Partial characterizations of circular‐arc graphs
- 9 April 2009
- journal article
- research article
- Published by Wiley in Journal of Graph Theory
- Vol. 61 (4) , 289-306
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Polynomial time recognition of unit circular-arc graphsJournal of Algorithms, 2006
- Efficient construction of unit circular-arc models2006
- The structure of claw-free graphs2005
- Interval bigraphs and circular arc graphsJournal of Graph Theory, 2004
- Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval GraphsSIAM Journal on Computing, 1996
- On chordal proper circular arc graphsDiscrete Mathematics, 1994
- (K4-e)-free perfect graphs and star cutsets1989
- On Graphs Without Multicliqual EdgesJournal of Graph Theory, 1981
- Complement reducible graphsDiscrete Applied Mathematics, 1981
- Representation of a finite graph by a set of intervals on the real lineFundamenta Mathematicae, 1962