English

k-Colorability of P5-free graphs

Discrete Mathematics 2007-05-23 v1 Data Structures and Algorithms
Authors: C. T. Hoang , J. Sawada , X. Shu
View on arXiv ↗ PDF ↗

Abstract

A polynomial time algorithm that determines for a fixed integer k whether or not a P5-free graph can be k-colored is presented in this paper. If such a coloring exists, the algorithm will produce a valid k-coloring.

Keywords

k-colorability P5-free graphs polynomial algorithm graph coloring algorithm

Cite

@article{arxiv.cs/0609083,
  title  = {k-Colorability of P5-free graphs},
  author = {C. T. Hoang and J. Sawada and X. Shu},
  journal= {arXiv preprint arXiv:cs/0609083},
  year   = {2007}
}

Related papers

View all related →
Data Structures and Algorithms · Computer Science
Deciding k-colourability of $P_5$-free graphs in polynomial time
Chính T. Hoàng, Marcin Kamiński, Vadim Lozin, J. Sawada +1
2016-08-14
Discrete Mathematics · Computer Science
Polynomial-time algorithm for vertex k-colorability of P_5-free graphs
Marcin Kaminski, Vadim Lozin
2007-05-23
Discrete Mathematics · Computer Science
The coloring problem for $\{P_5,\bar{P_5}\}$-free graphs and $\{P_5,K_p-e\}$-free graphs is polynomial
D. S. Malyshev, O. O. Lobanova
2015-03-10
Combinatorics · Mathematics
Some Results on $k$-Critical $P_5$-Free Graphs
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
2021-08-21
Combinatorics · Mathematics
On color-critical ($P_{5},\overline{P}_5$)-free graphs
Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray +2
2014-12-01
Discrete Mathematics · Computer Science
A certifying algorithm for 3-colorability of P5-free graphs
Daniel Bruce, Chinh T. Hoang, Joe Sawada
2009-07-22
Combinatorics · Mathematics
A refinement on the structure of vertex-critical ($P_5$, gem)-free graphs
Ben Cameron, Chính T. Hoàng
2022-12-12
Data Structures and Algorithms · Computer Science
Maximum Partial List H-Coloring on P_5-free graphs in polynomial time
Daniel Lokshtanov, Paweł Rzążewski, Saket Saurabh, Roohani Sharma +1
2026-03-06
Combinatorics · Mathematics
4-coloring ($P_6$, bull)-free graphs
Frédéric Maffray, Lucas Pastor
2016-02-25
Discrete Mathematics · Computer Science
Polynomial-time algorithms for minimum weighted colorings of ($P_5, \bar{P}_5$)-free graphs and related graph classes
Chính T. Hoàng, D. Adam Lazzarato
2014-09-04
Data Structures and Algorithms · Computer Science
Colouring $(P_r+P_s)$-Free Graphs
Tereza Klimošová, Josef Malík, Tomáš Masařík, Jana Novotná +2
2026-02-19
Data Structures and Algorithms · Computer Science
Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective
Nick Brettell, Jake Horsfield, Daniel Paulusma
2020-04-27
Combinatorics · Mathematics
List-$k$-Coloring $H$-free graphs for all $k>4$
Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl
2025-04-08
Combinatorics · Mathematics
Coloring ($P_5$, bull)-free graphs
Frédéric Maffray
2017-07-28
Combinatorics · Mathematics
Some Results on Critical ($P_5,H$)-free Graphs
Wen Xia, Jorik Jooken, Jan Goedgebeur, Shenwei Huang
2024-03-12
Data Structures and Algorithms · Computer Science
List $k$-Colouring $P_t$-Free Graphs: a Mim-width Perspective
Nick Brettell, Jake Horsfield, Andrea Munaro, Daniel Paulusma
2021-08-27
Discrete Mathematics · Computer Science
Complexity of Coloring Graphs without Paths and Cycles
Pavol Hell, Shenwei Huang
2013-10-02
Data Structures and Algorithms · Computer Science
Classifying k-Edge Colouring for H-free Graphs
Esther Galby, Paloma T. Lima, Daniel Paulusma, Bernard Ries
2018-10-11
Computational Complexity · Computer Science
Improved Complexity Results on $k$-Coloring $P_t$-Free Graphs
Shenwei Huang
2013-10-07
Combinatorics · Mathematics
Critical $(P_5,W_4)$-Free Graphs
Wen Xia, Jorik Jooken, Jan Goedgebeur, Iain Beaton +2
2025-01-10
Combinatorics · Mathematics
Three-coloring graphs with no induced seven-vertex path I : the triangle-free case
Maria Chudnovsky, Peter Maceli, Mingxian Zhong
2014-09-19
Data Structures and Algorithms · Computer Science
List-coloring embedded graphs
Zdenek Dvorak, Ken-ichi Kawarabayashi
2012-10-30
Combinatorics · Mathematics
Certifying coloring algorithms for graphs without long induced paths
Marcin Kamiński, Anna Pstrucha
2017-03-08
Combinatorics · Mathematics
$k$-Critical Graphs in $P_5$-Free Graphs
Kathie Cameron, Jan Goedgebeur, Shenwei Huang, Yongtang Shi
2020-05-08
Computational Complexity · Computer Science
On Colouring $(2P_2,H)$-Free and $(P_5,H)$-Free Graphs
Konrad Dabrowski, Daniel Paulusma
2017-12-08