Closing complexity gaps for coloring problems on H-free graphs (2014)

First Author: Golovach P

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.ic.2014.02.004

Publication URI: http://dx.doi.org/10.1016/j.ic.2014.02.004

Type: Journal Article/Review

Parent Publication: Information and Computation