The Complexity of Coloring Circular Arcs and Chords
- 1 June 1980
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 1 (2) , 216-227
- https://doi.org/10.1137/0601025
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Some simplified NP-complete graph problemsPublished by Elsevier ,2002
- An Efficient Test for Circular-Arc GraphsSIAM Journal on Computing, 1980
- Coloring a Family of Circular ArcsSIAM Journal on Applied Mathematics, 1975
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Structure theorems for some circular-arc graphsDiscrete Mathematics, 1974
- Algorithms on circular‐arc graphsNetworks, 1974
- Algorithms for a maximum clique and a maximum independent set of a circle graphNetworks, 1973
- Matrix characterizations of circular-arc graphsPacific Journal of Mathematics, 1971
- QUEUES, STACKS AND GRAPHSPublished by Elsevier ,1971
- What Are the Intersection Graphs of Arcs in a Circle?The American Mathematical Monthly, 1969