An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- 1 June 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Algebraic Discrete Methods
- Vol. 2 (2) , 88-93
- https://doi.org/10.1137/0602012
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Cyclic Scheduling via Integer Programs with Circular OnesOperations Research, 1980
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980
- An Efficient Test for Circular-Arc GraphsSIAM Journal on Computing, 1980
- Minimum node disjoint path covering for circular-arc graphsInformation Processing Letters, 1979
- Coloring a Family of Circular ArcsSIAM Journal on Applied Mathematics, 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
- On a routing problemQuarterly of Applied Mathematics, 1958