A Note on k-Colorability of P5-Free Graphs

Authors:
Chính T. Hoàng;Marcin Kamiński;Vadim Lozin;Joe Sawada;Xiao Shu
Affiliations:
Physics and Computer Science, Wilfrid Laurier University, Canada;Department of Computer Science, Université Libre de Bruxelles, Belgium;DIMAP and Mathematics Institute, University of Warwick, United Kingdom;Computing and Information Science, University of Guelph, Canada;Computing and Information Science, University of Guelph, Canada
Venue:
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Year:
2008

Citing 5
Cited 1

Permutation Graphs and Transitive Graphs

Journal of the ACM (JACM)
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)
Note: On the complexity of 4-coloring graphs without long induced paths

Theoretical Computer Science

A Certifying Algorithm for 3-Colorability of P5-Free Graphs

ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a polynomial-time algorithm determining whether or not, for a fixed k, a P5-free graph can be k-colored. If such a coloring exists, the algorithm will produce one.