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 条
  • [41] A note on efficient domination in a superclass of P5-free graphs
    Brandstaedt, Andreas
    Le, Van Bang
    INFORMATION PROCESSING LETTERS, 2014, 114 (07) : 357 - 359
  • [42] On minimal cutsets in P5-free minimal imperfect graphs
    Barré, V
    Fouquet, JL
    DISCRETE MATHEMATICS, 2001, 236 (1-3) : 25 - 36
  • [43] P5-free augmenting graphs and the maximum stable set problem
    Gerber, MU
    Hertz, A
    Schindl, D
    DISCRETE APPLIED MATHEMATICS, 2003, 132 (1-3) : 109 - 119
  • [44] Chromatic number of P5-free graphs: Reed's conjecture
    Schiermeyer, Ingo
    DISCRETE MATHEMATICS, 2016, 339 (07) : 1940 - 1943
  • [45] Hitting all maximum stable sets in P5-free graphs
    Hajebi, Sepehr
    Li, Yanjia
    Spirkl, Sophie
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 165 : 142 - 163
  • [46] A characterization of P5-free graphs with a homeomorphically irreducible spanning tree
    Diemunsch, Jennifer
    Furuya, Michitaka
    Sharifzadeh, Maryarn
    Tsuchiya, Shoichi
    Wang, David
    Wise, Jennifer
    Yeager, Elyse
    DISCRETE APPLIED MATHEMATICS, 2015, 185 : 71 - 78
  • [47] A characterization of P5-free, diameter-2-critical graphs
    Haynes, Teresa W.
    Henning, Michael A.
    DISCRETE APPLIED MATHEMATICS, 2014, 169 : 135 - 139
  • [48] On the stability number of claw-free P5-free and more general graphs
    Discrete Appl Math, 1-3 (163-167):
  • [49] On the stability number of claw-free P5-free and more general graphs
    Brandstädt, A
    Hammer, PL
    DISCRETE APPLIED MATHEMATICS, 1999, 95 (1-3) : 163 - 167
  • [50] Some results on maximum stable sets in certain P5-free graphs
    Mosca, R
    DISCRETE APPLIED MATHEMATICS, 2003, 132 (1-3) : 175 - 183
12345