On Coloring Graphs without Induced Forests
From MaRDI portal
Publication:3060770
DOI10.1007/978-3-642-17514-5_14zbMath1310.68100OpenAlexW1539444946MaRDI 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
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Narrowing Down the Gap on the Complexity of Coloring P k -Free Graphs ⋮ Colouring vertices of triangle-free graphs without forests
This page was built for publication: On Coloring Graphs without Induced Forests