English

Polynomial-time algorithm for vertex k-colorability of P_5-free graphs

Discrete Mathematics 2007-05-23 v1 Data Structures and Algorithms
Authors: Marcin Kaminski , Vadim Lozin
View on arXiv ↗ PDF ↗

Abstract

We give the first polynomial-time algorithm for coloring vertices of P_5-free graphs with k colors. This settles an open problem and generalizes several previously known results.

Keywords

graph coloring

Cite

@article{arxiv.cs/0607115,
  title  = {Polynomial-time algorithm for vertex k-colorability of P_5-free graphs},
  author = {Marcin Kaminski and Vadim Lozin},
  journal= {arXiv preprint arXiv:cs/0607115},
  year   = {2007}
}

Related papers

View all related →
Discrete Mathematics · Computer Science
k-Colorability of P5-free graphs
C. T. Hoang, J. Sawada, X. Shu
2007-05-23
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
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
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
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
Polynomial Cases for the Vertex Coloring Problem
T. Karthick, Frédéric Maffray, Lucas Pastor
2018-06-04
Combinatorics · Mathematics
4-coloring ($P_6$, bull)-free graphs
Frédéric Maffray, Lucas Pastor
2016-02-25
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
A refinement on the structure of vertex-critical ($P_5$, gem)-free graphs
Ben Cameron, Chính T. Hoàng
2022-12-12
Discrete Mathematics · Computer Science
4-coloring $P_6$-free graphs with no induced 5-cycles
Maria Chudnovsky, Peter Maceli, Juraj Stacho, Mingxian Zhong
2014-07-10
Combinatorics · Mathematics
Coloring ($P_5$, bull)-free graphs
Frédéric Maffray
2017-07-28
Combinatorics · Mathematics
List-$k$-Coloring $H$-free graphs for all $k>4$
Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl
2025-04-08
Combinatorics · Mathematics
Some Results on $k$-Critical $P_5$-Free Graphs
Qingqiong Cai, Jan Goedgebeur, Shenwei Huang
2021-08-21
Discrete Mathematics · Computer Science
Three-coloring triangle-free graphs on surfaces VII. A linear-time algorithm
Zdenek Dvorak, Daniel Kral, Robin Thomas
2020-11-10
Discrete Mathematics · Computer Science
On the structure of ($4K_1$, $C_4$, $P_6$)-free graphs
Chính T. Hoàng, Ramin Javadi, Nicolas Trotignon
2025-12-01
Combinatorics · Mathematics
Four-coloring $P_6$-free graphs. I. Extending an excellent precoloring
Maria Chudnovsky, Sophie Spirkl, Mingxian Zhong
2018-07-16
Data Structures and Algorithms · Computer Science
Colouring Probe $H$-Free Graphs
Daniël Paulusma, Johannes Rauch, Erik Jan van Leeuwen
2025-12-30
Data Structures and Algorithms · Computer Science
Approximation Algorithms for Partially Colorable Graphs
Suprovat Ghoshal, Anand Louis, Rahul Raychaudhury
2019-09-02
Data Structures and Algorithms · Computer Science
Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
Nikhil Bansal, Neng Huang, Euiwoong Lee
2026-02-06
Discrete Mathematics · Computer Science
Complexity of Coloring Graphs without Paths and Cycles
Pavol Hell, Shenwei Huang
2013-10-02
Computational Complexity · Computer Science
Improved Complexity Results on $k$-Coloring $P_t$-Free Graphs
Shenwei Huang
2013-10-07
Combinatorics · Mathematics
Three-coloring triangle-free graphs on surfaces VI. 3-colorability of quadrangulations
Zdenek Dvorak, Daniel Kral, Robin Thomas
2020-08-20
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
Combinatorics · Mathematics
Maximum $k$-colourable induced subgraphs in $(P_5+rK_1)$-free graphs
Cicely Henderson, Evelyne Smith-Roberge, Sophie Spirkl, Rebecca Whitman
2025-11-17
R2 v1 2026-07-22T12:26:14.484Z