On Coloring Graphs without Induced Forests
From MaRDI portal
Publication:3060770
DOI10.1007/978-3-642-17514-5_14zbMath1310.68100MaRDI QIDQ3060770
Jian Song, Petr A. Golovach, Daniël Paulusma, Hajo J. Broersma
Publication date: 9 December 2010
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-17514-5_14
68Q25: Analysis of algorithms and problem complexity
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Colouring vertices of triangle-free graphs without forests, Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs