scientific article; zbMATH DE number 15868
[For the entire collection see Zbl 0709.00011.] From the introduction: The purpose of this note is to present new short proofs of three fundamental results on comparability graphs and their associated transitive orientations. The first result is that of Ševrin and Filippov which describes how one transitive orientation of a fixed comparability graph \(G\) can be modified in order to obtain any other transitive orientation. The second result is a refined version, due to Hanlon, in the case where \(G\) is the complement of an interval graph. Finally, we present a short proof of Golumbic's multiplex decomposition theorem. The proofs are based on a simple observation on maximal nontrivial partitive sets defined in the paper.
- The graph of partial orders
- scientific article; zbMATH DE number 1163943
- On ordered graphs and graph orderings
- Partial order complementation graphs
- scientific article; zbMATH DE number 4139805
- On the partial order polytope of a digraph
- Polyhedral aspects of partial orders and comparability graphs
- scientific article; zbMATH DE number 4103134
- Analytic partial orders and oriented graphs
- Graphical partially ordered sets
- Comparability graphs with constraint, partial semi-orders and interval orders
- The partial order graph for a ZME-matrix
- scientific article; zbMATH DE number 434480 (Why is no real title available?)
- The niche graphs of doubly partial orders
- scientific article; zbMATH DE number 3914376 (Why is no real title available?)
- scientific article; zbMATH DE number 1028228 (Why is no real title available?)
- Closed orders and closed graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3972518)
