Almost all comparability graphs are UPO
- 31 December 1984
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 50, 63-70
- https://doi.org/10.1016/0012-365x(84)90035-9
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Substitution Decomposition for Discrete Structures and Connections with Combinatorial OptimizationNorth-Holland Mathematics Studies, 1984
- A Fast Algorithm for the Decomposition of Graphs and PosetsMathematics of Operations Research, 1983
- The Dimension of Finite and Infinite Comparability GraphsJournal of the London Mathematical Society, 1980
- Properties of almost all graphs and complexesJournal of Graph Theory, 1979
- Probabilities on finite modelsThe Journal of Symbolic Logic, 1976
- Asymptotic enumeration of partial orders on a finite setTransactions of the American Mathematical Society, 1975
- Uniquely Partially Orderable GraphsJournal of the London Mathematical Society, 1971
- To the undimmed memory of petr Grigor'evich Kontorovich: Partially ordered sets and their comparability graphsSiberian Mathematical Journal, 1970
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Graph derivativesMathematische Zeitschrift, 1961