What people are saying - Write a review
We haven't found any reviews in the usual places.
Intersection and Containment Representations
Real Numbers in Graph Representations
Classes Which use Global Information
Intersection of Graph Classes
Graph Classes Defined by Forbidden Subgraphs
Robust Algorithms for Optimization Problems
Characterization and Construction
Survey of Results on Graph Classes
Other editions - View all
adjacency list adjacency matrix bound boxicity chapter chordal bipartite graphs chordal comparability graphs chordal graphs chordless cycle circle graph circular-arc graphs class of graphs classes defined clique cover clique problem clique separator clique-width co-comparability graphs cographs color class column comparability graph complement computing construct corresponding cycle of length decomposable decomposition tree dimension dominating set edge endpoints entries exercise F-free graph classes graph G graph recognition graphs of paths implicit representation induced subgraph intersection graphs interval graphs interval number join decomposition matrix multiplication maximum clique module neighbors node nonadjacent nonneighbors NP-complete number of graphs O(n+m O(nlogn Open Problem pair of vertices path graphs perfect elimination scheme perfect graphs permutation graphs polygon polynomial poset proof recognition algorithm robust algorithm Show skew partition solved split graphs stored strongly chordal graphs subset substitution decomposition theorem tolerance graphs transitive orientation trapezoid graphs treewidth unit disk graphs visibility graph weakly chordal graphs
Page 11 - A graph is an interval graph if one can associate with each vertex an interval on the real line such that two vertices are adjacent if and only if the corresponding intervals have a nonempty intersection.