On the parameterized complexity of coloring graphs in the absence of a linear forest
From MaRDI portal
Publication:450579
DOI10.1016/j.jda.2012.04.008zbMath1247.68108MaRDI QIDQ450579
Daniël Paulusma, Jean-François Couturier, Dieter Kratsch, Petr A. Golovach
Publication date: 13 September 2012
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: http://dro.dur.ac.uk/10695/1/10695.pdf
Related Items
Colouring of graphs with Ramsey-type forbidden subgraphs, A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs
Cites Work
- Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time
- Updating the complexity status of coloring graphs without a fixed induced linear forest
- Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time
- On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
- Generalized coloring for tree-like graphs
- 3-colorability \(\in \mathcal P\) for \(P_{6}\)-free graphs.
- Vertex colouring and forbidden subgraphs -- a survey
- On the complexity of 4-coloring graphs without long induced paths
- 4-Coloring H-Free Graphs When H Is Small
- Colouring Vertices of Triangle-Free Graphs
- List Coloring in the Absence of a Linear Forest
- Three Complexity Results on Coloring P k -Free Graphs
- A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
- On graphs with polynomially solvable maximum-weight clique problem
- The NP-Completeness of Edge-Coloring
- A New Algorithm for Generating All the Maximal Independent Sets
- Graph colorings with local constraints -- a survey
- NP completeness of finding the chromatic index of regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
