On the NP-completeness of the k-colorability problem for triangle-free graphs
Discrete Mathematics
Generalized coloring for tree-like graphs
Discrete Applied Mathematics
The complexity of coloring graphs without long induced paths
Acta Cybernetica
Complexity of Coloring Graphs without Forbidden Induced Subgraphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
3-Colorability ∈ P for P6-free graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Vertex Colouring and Forbidden Subgraphs – A Survey
Graphs and Combinatorics
Note: On the complexity of 4-coloring graphs without long induced paths
Theoretical Computer Science
Graph Theory
A Certifying Algorithm for 3-Colorability of P5-Free Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
Algorithmica - Including a Special Section on Genetic and Evolutionary Computation; Guest Editors: Benjamin Doerr, Frank Neumann and Ingo Wegener
Colouring vertices of triangle-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Updating the complexity status of coloring graphs without a fixed induced linear forest
Theoretical Computer Science
Determining the chromatic number of triangle-free 2P3-free graphs in polynomial time
Theoretical Computer Science
List coloring in the absence of a linear forest
WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science
4-coloring h-free graphs when h is small
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Parameterized Complexity
4-coloring H-free graphs when H is small
Discrete Applied Mathematics
Information Processing Letters
Colouring of graphs with Ramsey-type forbidden subgraphs
Theoretical Computer Science
Hi-index | 0.00 |
The k-Coloring problem is to decide whether a graph can be colored with at most k colors such that no two adjacent vertices receive the same color. The Listk-Coloring problem requires in addition that every vertex u must receive a color from some given set L(u)@?{1,...,k}. Let P"n denote the path on n vertices, and G+H and rH the disjoint union of two graphs G and H and r copies of H, respectively. We show that Listk-Coloring is fixed-parameter tractable on graphs with no induced rP"1+P"2 when parameterized by k+r, and that for any fixed integer r, the problem k-Coloring restricted to such graphs allows a polynomial kernel when parameterized by k. Finally, we show that Listk-Coloring is fixed-parameter tractable on graphs with no induced P"1+P"3 when parameterized by k.