📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

Three Complexity Results on Coloring P k -Free Graphs

First Author: Broersma H

Attributed to: Exact algorithms for NP-hard problems funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-10217-2_12

Publication URI: http://dx.doi.org/10.1007/978-3-642-10217-2_12

Type: Book Chapter

Book Title: Combinatorial Algorithms (2009)

Page Reference: 95-104

ISSN: 03029743 16113349