Determining the chromatic number of triangle-free 2 P 3 -free graphs in polynomial time (2012)
Attributed to:
Algorithmic Aspects of Graph Coloring
funded by
EPSRC
Abstract
No abstract provided
Bibliographic Information
Digital Object Identifier: http://dx.doi.org/10.1016/j.tcs.2011.12.076
Publication URI: http://dx.doi.org/10.1016/j.tcs.2011.12.076
Type: Journal Article/Review
Parent Publication: Theoretical Computer Science