scholar.google.com › citations
A simple, undirected graph is a comparability graph if its edges can be transitively oriented, thus producing a partial order. Using characteristic vectors in R ...
People also ask
What is the difference between a polyhedral and a polytope?
Is every comparability graph perfect?
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.
Missing: Polyhedral | Show results with:Polyhedral
The comparability graph of a partial order (V,<=) has node set V and edge xy whenever x<=y or y<=x. G is a comparability if it is the comparability graph of ...
Missing: Polyhedral | Show results with:Polyhedral
Comparability graphs are undirected graphs that represent the comparability relation of partial orders. They constitute an important interface between graphs ...
In this paper we introduce the notion of the containment graph of a family of sets and containment classes of graphs and posets.
Missing: Polyhedral | Show results with:Polyhedral
The comparability graphs of series-parallel partial orders are cographs. Series-parallel partial orders have been applied in job shop scheduling, ...
Missing: Polyhedral | Show results with:Polyhedral
Comparability graphs are also known as transitively orientable graphs and partially orderable graphs. Examples of several comparability graphs are presented.
Missing: Polyhedral | Show results with:Polyhedral
On the other hand, an interval order can have large dimension, but an interval order does not contain a fence of 5 or more points as a subposet.
Missing: Polyhedral | Show results with:Polyhedral
The complement of a comparability graph is called a cocomparability graph. There is a kind of duality between a cocomparability graph and the partial orders ...
A simple, undirected graph is a comparability graph if its edges can be transitively oriented, thus producing a partial order. Using characteristic vectors in ...
People also search for