Narrowing the Complexity Gap for Colouring ( C s , P t )-Free Graphs (2015)

First Author: Huang S

Attributed to: Algorithmic Aspects of Graph Coloring funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1093/comjnl/bxv039

Publication URI: http://dx.doi.org/10.1093/comjnl/bxv039

Type: Journal Article/Review

Parent Publication: The Computer Journal

Issue: 11