Three Complexity Results on Coloring P k -Free Graphs
Attributed to:
Algorithmic Aspects of Graph Coloring
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-10217-2_12
Publication URI: http://dx.doi.org/10.1007/978-3-642-10217-2_12
Type: Book Chapter
Book Title: Combinatorial Algorithms (2009)
Page Reference: 95-104
ISSN: 03029743 16113349