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 条
  • [1] Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
    Hoang, Chinh T.
    Kaminski, Marcin
    Lozin, Vadim
    Sawada, Joe
    Shu, Xiao
    ALGORITHMICA, 2010, 57 (01) : 74 - 81
  • [2] Deciding k-colorability in expected polynomial time
    Krivelevich, M
    INFORMATION PROCESSING LETTERS, 2002, 81 (01) : 1 - 6
  • [3] A note on k-colorability of P-free graphs
    Hoang, Chinh T.
    Kaminski, Marcin
    Lozin, Vadim
    Sawada, Joe
    Shu, Xiao
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2008, PROCEEDINGS, 2008, 5162 : 387 - +
  • [4] A Certifying Algorithm for 3-Colorability of P5-Free Graphs
    Bruce, Daniel
    Hoang, Chinh T.
    Sawada, Joe
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 594 - +
  • [5] k-Critical graphs in P5-free graphs
    Cameron, Kathie
    Goedgebeur, Jan
    Huang, Shenwei
    Shi, Yongtang
    THEORETICAL COMPUTER SCIENCE, 2021, 864 : 80 - 91
  • [6] k-Critical Graphs in P5-Free Graphs
    Cameron, Kathie
    Goedgebeur, Jan
    Huang, Shenwei
    Shi, Yongtang
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 411 - 422
  • [7] Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time
    Agrawal, Akanksha
    Lima, Paloma T.
    Lokshtanov, Daniel
    Saurabh, Saket
    Sharma, Roohani
    PROCEEDINGS OF THE 2024 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2024, : 5276 - 5290
  • [8] Odd Cycle Transversal on P5-free Graphs in Quasi-polynomial Time
    Agrawal, Akanksha
    Lima, Paloma T.
    Lokshtanov, Daniel
    Saurabh, Saket
    Sharma, Roohani
    Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, 2024, 2024-January : 5276 - 5290
  • [9] On the NP-completeness of the k-colorability problem for triangle-free graphs
    Maffray, F
    Preissmann, M
    DISCRETE MATHEMATICS, 1996, 162 (1-3) : 313 - 317
  • [10] Constructions of k-critical P5-free graphs
    Hoang, Chinh T.
    Moore, Brian
    Recoskie, Daniel
    Sawada, Joe
    Vatshelle, Martin
    DISCRETE APPLIED MATHEMATICS, 2015, 182 : 91 - 98
12345