Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds
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-16926-7_6
Publication URI: http://dx.doi.org/10.1007/978-3-642-16926-7_6
Type: Book Chapter
Book Title: Graph Theoretic Concepts in Computer Science (2010)
Page Reference: 39-50
ISSN: 03029743 16113349