The complexity of coloring graphs without long induced paths

Acta Cybernetica

Volumn 15, Issue 1, 2001, Pages 107-117

  Woeginger, Gerhard J ^a   Sgall, Jiří ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b MATHEMATICAL INSTITUTE   (Czech Republic)

Author keywords

Chromatic number; Computational complexity; Graph coloring; Induced path

Indexed keywords

EID: 0034891323     PISSN: 0324721X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (3)

1. M.R. Garey and D.S. Johnson [1979]. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco.
2. M.C. Golumbic [1980]. Algorithmic Graph Thery and Perfect Graphs. Academic Press, New York.
3. D.S. Johnson [1985]. The NP-completeness column: An ongoing guide. Journal of Algorithms 6, 434-451.