Deciding k-Colorability of P5-Free Graphs in Polynomial Time

被引：0

作者：

Chính T. Hoàng

Marcin Kamiński

Vadim Lozin

Joe Sawada

Xiao Shu

机构：

[1] Wilfrid Laurier University,Physics and Computer Science

[2] Rutgers University,RUTCOR

[3] University of Warwick,DIMAP and Mathematics Institute

[4] University of Guelph,Computing and Information Science

来源：

Algorithmica | 2010年 / 57卷

关键词：

Graph coloring; Dominating clique; Polynomial-time algorithm; -free graph;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

The problem of computing the chromatic number of a P5-free graph (a graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show that for every fixed integer k, there exists a polynomial-time algorithm determining whether or not a P5-free graph admits a k-coloring, and finding one, if it does.

引用

页码：74 / 81

页数：7

共 50 条

[21] A subquadratic certification scheme for P5-free graphs
Bousquet, Nicolas
Zeitoun, Sebastien
THEORETICAL COMPUTER SCIENCE, 2025, 1033
[22] Paired-Domination in P5-Free Graphs
Paul Dorbec
Sylvain Gravier
Graphs and Combinatorics, 2008, 24 : 303 - 308
[23] On the chromatic number of some P5-free graphs
Dong, Wei
Xu, Baogang
Xu, Yian
DISCRETE MATHEMATICS, 2022, 345 (10)
[24] STABILITY NUMBER IN SUBCLASSES OF P5-FREE GRAPHS
Zverovich I E
Zverovich O I
Applied Mathematics:A Journal of Chinese Universities, 2004, (02) : 125 - 132
[25] Spectral properties of cographs and P5-free graphs
Ghorbani, Ebrahim
LINEAR & MULTILINEAR ALGEBRA, 2019, 67 (08): : 1701 - 1710
[26] t-PERFECTION IN P5-FREE GRAPHS
Bruhn, Henning
Fuchs, Elke
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2017, 31 (03) : 1616 - 1633
[27] Stability number in subclasses of P5-free graphs
Zverovich I.E.
Zverovich O.I.
Applied Mathematics-A Journal of Chinese Universities, 2004, 19 (2) : 125 - 132
[28] Recognition and Optimization Algorithms for P5-Free Graphs
Talmaciu, Mihai
Dumitriu, Luminita
Susnea, Ioan
Lepin, Victor
Iantovics, Laszlo Barna
SYMMETRY-BASEL, 2020, 12 (02):
[29] EFFECTIVE ONLINE COLORING OF P5-FREE GRAPHS
GYARFAS, A
LEHEL, J
COMBINATORICA, 1991, 11 (02) : 181 - 184
[30] On maximum independent sets in P5-free graphs
Randerath, Bert
Schiermeyer, Ingo
DISCRETE APPLIED MATHEMATICS, 2010, 158 (09) : 1041 - 1044

← 1 2 3 4 5 →