Paths in interval graphs and circular arc graphs
Author:
- 1 March 1993
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 112 (1-3) , 49-64
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- The Hamiltonian circuit problem for circle graphs is NP-completeInformation Processing Letters, 1989
- Finding maximum cliques on circular-arc graphsInformation Processing Letters, 1987
- Hamiltonian circuits in interval graph generalizationsInformation Processing Letters, 1986
- Dominating sets and domatic number of circular arc graphsDiscrete Applied Mathematics, 1985
- The NP-completeness column: an ongoing guideJournal of Algorithms, 1985
- Interval graphs and related topicsDiscrete Mathematics, 1985
- Finding Hamiltonian circuits in interval graphsInformation Processing Letters, 1985
- Finding Hamiltonian circuits in proper interval graphsInformation Processing Letters, 1983
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- A Characterization of Comparability Graphs and of Interval GraphsCanadian Journal of Mathematics, 1964