4-Coloring H-Free Graphs When H Is Small
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-27660-6_24
Publication URI: http://dx.doi.org/10.1007/978-3-642-27660-6_24
Type: Book Chapter
Book Title: SOFSEM 2012: Theory and Practice of Computer Science (2012)
Page Reference: 289-300
ISSN: 03029743 16113349