Exploring the complexity boundary between coloring and list-coloring
- 2 July 2008
- journal article
- Published by Springer Science and Business Media LLC in Annals of Operations Research
- Vol. 169 (1), 3-16
- https://doi.org/10.1007/s10479-008-0391-5
Abstract
No abstract availableThis publication has 21 references indexed in Scilit:
- Exploring the complexity boundary between coloring and list-coloringElectronic Notes in Discrete Mathematics, 2006
- Between coloring and list-coloring: μ-coloringElectronic Notes in Discrete Mathematics, 2005
- Graph Classes: A SurveyPublished by Society for Industrial & Applied Mathematics (SIAM) ,1999
- Precoloring extension. I. Interval graphsDiscrete Mathematics, 1992
- Distance-hereditary graphsJournal of Combinatorial Theory, Series B, 1986
- Clustering and domination in perfect graphsDiscrete Applied Mathematics, 1984
- Dominating sets for split and bipartite graphsInformation Processing Letters, 1984
- The complexity of completing partial Latin squaresDiscrete Applied Mathematics, 1984
- The Complexity of Coloring Circular Arcs and ChordsSIAM Journal on Algebraic Discrete Methods, 1980
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976