Comparability graphs and a new matroid
Author:
- Martin Charles GolumbicMGMartin Charles Golumbic
- 1 February 1977
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 22 (1) , 68-90
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- 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
- Segment-Preserving Maps of Partial OrdersTransactions of the American Mathematical Society, 1972
- Uniquely Partially Orderable GraphsJournal of the London Mathematical Society, 1971
- An interval graph is not a comparability graphJournal of Combinatorial Theory, 1970
- Graphs and partial orderingsMonatshefte für Mathematik, 1969
- Transitiv orientierbare GraphenActa Mathematica Hungarica, 1967
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962
- Partially Ordered SetsAmerican Journal of Mathematics, 1941