Comparability Graph

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

See also

Interval Graph, Partially Ordered Set

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

Cite this as:

Weisstein, Eric W. "Comparability Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/ComparabilityGraph.html

Subject classifications