Comparability graph

In graph theory and order theory, a comparability graph is an undirected graph that connects pairs of elements that are comparable to each other in a partial order. Comparability graphs have also been called transitively orientable graphs, partially orderable graphs, containment graphs,^[1] and divisor graphs.^[2] An incomparability graph is an undirected graph that connects pairs of elements that are not comparable to each other in a partial order.

^ Golumbic (1980), p. 105; Brandstädt, Le & Spinrad (1999), p. 94.
^ Chartrand et al. (2001).

[1] Golumbic (1980), p. 105; Brandstädt, Le & Spinrad (1999), p. 94.

[FOOTNOTEChartrandMunteanSaenpholphatZhang2001-2] Chartrand et al. (2001).

[1]

[2]