A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (2016)

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.1002/jgt.22028

Publication URI: http://dx.doi.org/10.1002/jgt.22028

Type: Journal Article/Review

Parent Publication: Journal of Graph Theory

Issue: 4