Recommendations
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3813681 (Why is no real title available?)
- scientific article; zbMATH DE number 3906240 (Why is no real title available?)
- scientific article; zbMATH DE number 3922536 (Why is no real title available?)
- scientific article; zbMATH DE number 3720674 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A Fast Algorithm for the Decomposition of Graphs and Posets
- Asymptotic Enumeration of Partial Orders on a Finite Set
- Graph derivatives
- Partially ordered sets and their comparability graphs
- Probabilities on finite models
- Properties of almost all graphs and complexes
- The Dimension of Finite and Infinite Comparability Graphs
- The Dimension of a Comparability Graph
- Uniquely Partially Orderable Graphs
Cited in
(8)- Schedule-induced posets
- A \(k\)-structure generalization of the theory of 2-structures
- A tight lower bound for primitivity in k-structures
- On some complexity properties of N-free posets and posets with bounded decomposition diameter
- Partial order complementation graphs
- Eigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
- \(\boldsymbol{(\alpha, \beta )}\)-Modules in Graphs
- Largest eigenvalue of the Laplacian matrix: its eigenspace and transitive orientations
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)
