scientific article; zbMATH DE number 5179133
From MaRDI portal
Publication:5755526
zbMath1186.05053MaRDI QIDQ5755526
Marcin Kaminski, Vadim V. Lozin
Publication date: 13 August 2007
Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/2730
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable ⋮ 4-Coloring H-Free Graphs When H Is Small ⋮ Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ On the parameterized complexity of coloring graphs in the absence of a linear forest ⋮ Coloring graphs characterized by a forbidden subgraph ⋮ Coloring vertices of claw-free graphs in three colors ⋮ List coloring in the absence of a linear forest ⋮ Colouring Vertices of Triangle-Free Graphs ⋮ Colouring vertices of triangle-free graphs without forests ⋮ List Coloring in the Absence of a Linear Forest