3-Colorability ∈ P for P6-free graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Note: On the complexity of 4-coloring graphs without long induced paths
Theoretical Computer Science
Efficiency in exponential time for domination-type problems
Discrete Applied Mathematics
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences
Journal of Combinatorial Theory Series B
A Certifying Algorithm for 3-Colorability of P5-Free Graphs
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Chromatic index of graphs with no cycle with a unique chord
Theoretical Computer Science
First-Fit coloring of {P5,K4-e}-free graphs
Discrete Applied Mathematics
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
On-line coloring of h-free bipartite graphs
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
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
On the parameterized complexity of coloring graphs in the absence of a linear forest
Journal of Discrete Algorithms
Coloring graphs characterized by a forbidden subgraph
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
The P versus NP-complete dichotomy of some challenging problems in graph theory
Discrete Applied Mathematics
4-coloring H-free graphs when H is small
Discrete Applied Mathematics
Three complexity results on coloring Pk-free graphs
European Journal of Combinatorics
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.00 |
There is a great variety of colouring concepts and results in the literature. Here our focus is to survey results on vertex colourings of graphs defined in terms of forbidden induced subgraph conditions. Thus, one who wishes to obtain useful results from a graph coloring formulation of his problem must do more than just show that the problem is equivalent to the general problem of coloring a graph. If there is to be any hope, one must also obtain information about the structure of the graphs that need to be colored (D.S. Johnson [66]).