Coloring Graphs Characterized by a Forbidden Subgraph

DOI10.1007/978-3-642-32589-2_40zbMath1365.68279OpenAlexW1508337651MaRDI QIDQ2912743

Petr A. Golovach, Bernard Ries, Daniël Paulusma

Publication date: 25 September 2012

Published in: Mathematical Foundations of Computer Science 2012 (Search for Journal in Brave)

Full work available at URL: http://dro.dur.ac.uk/14118/1/14118.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

List coloring in the absence of two subgraphs ⋮ On the complexity of colouring antiprismatic graphs

This page was built for publication: Coloring Graphs Characterized by a Forbidden Subgraph