On the parameterized complexity of coloring graphs in the absence of a linear forest (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.jda.2012.04.008
Publication URI: http://dx.doi.org/10.1016/j.jda.2012.04.008
Type: Journal Article/Review
Parent Publication: Journal of Discrete Algorithms