Information Processing Letters
On the NP-completeness of the k-colorability problem for triangle-free graphs
Discrete Mathematics
3-Colorability ∈ P for P6-free graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
A Note on k-Colorability of P5-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Stable sets in k-colorable P5-free graphs
Information Processing Letters
A Certifying Algorithm for 3-Colorability of P5-Free Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Note: A decidability result for the dominating set problem
Theoretical Computer Science
MAX-CUT and containment relations in graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Narrowing down the gap on the complexity of coloring Pk-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Colouring vertices of triangle-free graphs
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
Coloring graphs without short cycles and long induced paths
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
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
Note: max-cut and containment relations in graphs
Theoretical Computer Science
On the parameterized complexity of coloring graphs in the absence of a linear forest
Journal of Discrete Algorithms
Linear time algorithm for computing a small biclique in graphs without long induced paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Coloring graphs characterized by a forbidden subgraph
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
4-coloring H-free graphs when H is small
Discrete Applied Mathematics
Three complexity results on coloring Pk-free graphs
European Journal of Combinatorics
Graph isomorphism for graph classes characterized by two forbidden induced subgraphs
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Information Processing Letters
Colouring of graphs with Ramsey-type forbidden subgraphs
Theoretical Computer Science
List coloring in the absence of two subgraphs
Discrete Applied Mathematics
Coloring graphs without short cycles and long induced paths
Discrete Applied Mathematics
| Hi-index | 0.01 |
We give a complete characterization of parameter graphs H for which the problem of coloring H-free graphs is polynomial and for which it is NP-complete. We further initiate a study of this problem for two forbidden subgraphs.