Three complexity results on coloring P k -free graphs (2013)

First Author: Broersma H

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.ejc.2011.12.008

Publication URI: http://dx.doi.org/10.1016/j.ejc.2011.12.008

Type: Journal Article/Review

Parent Publication: European Journal of Combinatorics

Issue: 3