Algorithmic Aspects of Comparability Graphs and Interval Graphs
- 1 January 1985
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 60 references indexed in Scilit:
- Ordered Sets and Social SciencesPublished by Springer Nature ,1982
- An algorithm for generating all maximal independent subsets of posetsComputing, 1981
- The Dimension of Finite and Infinite Comparability GraphsJournal of the London Mathematical Society, 1980
- Combinatorial TheoryPublished by Springer Nature ,1979
- Graphs with unique maximal clumpingsJournal of Graph Theory, 1978
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- A homomorphism theorem for finite graphsProceedings of the American Mathematical Society, 1976
- Partial orders of dimension 2Networks, 1972
- Uniquely Partially Orderable GraphsJournal of the London Mathematical Society, 1971
- Modules of Coherent Binary SystemsJournal of the Society for Industrial and Applied Mathematics, 1965