In graph theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability...

graph. Finite comparability graphs (and their complementary incomparability graphs) are always perfect. A clique, in a comparability graph, comes from a...

complement is a comparability graph, it follows that graph and its complement are both interval graphs if and only if the graph is both a split graph and a permutation...

any two comparable elements. Thus, a clique in a comparability graph corresponds to a chain, and an independent set in a comparability graph corresponds...

graph in F is also locally F. For instance, every chordal graph is locally chordal; every perfect graph is locally perfect; every comparability graph...

are comparable in the partial order. Equivalently, a comparability graph is a graph that has a transitive orientation. Many other classes of graphs can...

Look up comparability in Wiktionary, the free dictionary. In mathematics, two elements x and y of a set P are said to be comparable with respect to a...

that such a graph is perfect." Trivially perfect graphs are also known as comparability graphs of trees, arborescent comparability graphs, and quasi-threshold...

special cases of the distance-hereditary graphs, permutation graphs, comparability graphs, and perfect graphs. Any cograph may be constructed using the...

{\overline {G}}} are comparability graphs. A graph G {\displaystyle G} is a permutation graph if and only if it is the comparability graph of a partially ordered...