A coloring algorithm for 4K1-free line graphs

被引：5
|
作者：
Fraser, Dallas J. [1 ]
Hamel, Angele M. [1 ]
Hoang, Chinh T. [1 ]
Maffray, Frederic [2 ]
机构：
[1] Wilfrid Laurier Univ, Dept Phys & Comp Sci, Waterloo, ON, Canada
[2] Univ Grenoble Alpes, CNRS, Lab G SCOP, Grenoble, France
来源：
DISCRETE APPLIED MATHEMATICS | 2018年 / 234卷
基金：
加拿大自然科学与工程研究理事会;
关键词：
Graph coloring; Claw; K-5 \ e; Line-graph;
D O I：
10.1016/j.dam.2017.06.006
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Given a family F of graphs, let Free(F) be the class of graphs that do not contain any member of as an induced subgraph. When F is a set of four-vertex graphs the complexity of the vertex coloring problem in Free(F) is known, with three exceptions: F = {claw, 4K(1)}, = {claw, 4K(1), co-diamond}, and F = {C-4, 4K(1)}. In this paper, we study the coloring problem for Free(claw, 4K(1)). We solve the vertex coloring problem for a subclass of Free(claw, 4K(1)) which contains the class of 4K(1)-free line graphs. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：76 / 85
页数：10
相关论文
共 50 条
  • [31] On-line graph coloring of P5-free graphs
    Cieslik, Iwona
    ACTA INFORMATICA, 2008, 45 (02) : 79 - 91
  • [32] EDGE COLORING LINE GRAPHS OF UNICYCLIC GRAPHS
    CAI, LZ
    ELLIS, JA
    DISCRETE APPLIED MATHEMATICS, 1992, 36 (01) : 75 - 82
  • [33] COLORING CLAW-FREE GRAPHS WITH Δ-1 COLORS
    Cranston, Daniel W.
    Rabern, Landon
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (01) : 534 - 549
  • [34] Coloring hammer-free graphs with Δ-1 colors
    Chen, Rong
    Lan, Kaiyang
    Lin, Xinheng
    DISCRETE MATHEMATICS, 2024, 347 (03)
  • [35] A NOTE ON POLYNOMIAL ALGORITHM FOR COST COLORING OF BIPARTITE GRAPHS WITH Δ ≤ 4
    Giaro, Krzysztof
    Kubale, Marek
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2020, 40 (03) : 885 - 891
  • [36] First-Fit coloring of {P5, K4 - e}-free graphs
    Choudum, S. A.
    Karthick, T.
    DISCRETE APPLIED MATHEMATICS, 2010, 158 (06) : 620 - 626
  • [37] 5-coloring K3,k-minor-free graphs
    Kawarabayashi, Ken-ichi
    PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 985 - 1003
  • [38] K-1,K-3-free and W-4-free graphs
    Kloks, T
    INFORMATION PROCESSING LETTERS, 1996, 60 (04) : 221 - 223
  • [39] Coloring quasi-line graphs
    Chudnovsky, Maria
    Ovetsky, Alexandra
    JOURNAL OF GRAPH THEORY, 2007, 54 (01) : 41 - 50
  • [40] On-line coloring κ-colorable graphs
    Kierstead, HA
    ISRAEL JOURNAL OF MATHEMATICS, 1998, 105 (1) : 93 - 104
12345