Almost all comparability graphs are UPO
From MaRDI portal
Publication:795847
DOI10.1016/0012-365X(84)90035-9zbMATH Open0543.05054MaRDI QIDQ795847FDOQ795847
Authors: Rolf H. Möhring 
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
Recommendations
Partial orders, general (06A06) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Asymptotic Enumeration of Partial Orders on a Finite Set
- Probabilities on finite models
- Graph derivatives
- Title not available (Why is that?)
- A Characterization of Comparability Graphs and of Interval Graphs
- Partially ordered sets and their comparability graphs
- A Fast Algorithm for the Decomposition of Graphs and Posets
- The Dimension of Finite and Infinite Comparability Graphs
- The Dimension of a Comparability Graph
- Properties of almost all graphs and complexes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniquely Partially Orderable Graphs
Cited In (8)
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- A tight lower bound for primitivity in k-structures
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
- Partial order complementation graphs
- A \(k\)-structure generalization of the theory of 2-structures
- Largest eigenvalue of the Laplacian matrix: its eigenspace and transitive orientations
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Schedule-induced posets
This page was built for publication: Almost all comparability graphs are UPO
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795847)
