Matrix multiplication via arithmetic progressions
Journal of Symbolic Computation - Special issue on computational algebraic complexity
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
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
SIAM Journal on Computing
Note: On the complexity of 4-coloring graphs without long induced paths
Theoretical Computer Science
A Note on k-Colorability of P5-Free Graphs
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
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
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
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
On the parameterized complexity of coloring graphs in the absence of a linear forest
Journal of Discrete Algorithms
4-coloring H-free graphs when H is small
Discrete Applied Mathematics
Three complexity results on coloring Pk-free graphs
European Journal of Combinatorics
Data reduction for graph coloring problems
Information and Computation
| Hi-index | 0.00 |
We provide a certifying algorithm for the problem of deciding whether a P 5-free graph is 3-colorable by showing there are exactly six finite graphs that are P 5-free and not 3-colorable and minimal with respect to this property.