The complexity of comparability graph recognition and coloring
- 1 September 1977
- journal article
- Published by Springer Nature in Computing
- Vol. 18 (3) , 199-208
- https://doi.org/10.1007/bf02253207
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Comparability graphs and a new matroidJournal of Combinatorial Theory, Series B, 1977
- Permutation Graphs and Transitive GraphsJournal of the ACM, 1972
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- Transitive Orientation of Graphs and Identification of Permutation GraphsCanadian Journal of Mathematics, 1971
- To the undimmed memory of petr Grigor'evich Kontorovich: Partially ordered sets and their comparability graphsSiberian Mathematical Journal, 1970
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964