Monday, July 25, 2005
Wow~~~Look at these definitions!!
A graph G = (V, E) is a comparability graph if there is a transitive orientation of its edges.
The comparability graph of a partial order (V,≦) has node set V, and edge (x, y) whenever x≦y or y≦x. G is a comparability if it is the comparability graph of some poset.
The comparability graph of a poset P = (X, ≦) is the graph with vertex set X for which vertices x and y are adjacent either x ≦ y or y ≦ x in P.
I'll keep studying the paper.