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 条
  • [21] On-line coloring of H-free bipartite graphs
    Broersma, H. J.
    Capponi, A.
    Paulusma, D.
    ALGORITHMS AND COMPLEXITY, PROCEEDINGS, 2006, 3998 : 284 - 295
  • [22] Coloring of a Superclass of 2K2-free graphs
    Prashant, Athmakoori
    Raj, S. Francis
    ALGORITHMS AND DISCRETE APPLIED MATHEMATICS, CALDAM 2023, 2023, 13947 : 192 - 203
  • [23] The total coloring of K5-minor-free graphs
    Yang, Fan
    Wu, Jianliang
    EUROPEAN JOURNAL OF COMBINATORICS, 2022, 102
  • [24] COLORING ALGORITHMS FOR K5-MINOR FREE GRAPHS
    KHULLER, S
    INFORMATION PROCESSING LETTERS, 1990, 34 (04) : 203 - 208
  • [25] The total coloring of K5-minor-free graphs
    Yang, Fan
    Wu, Jianliang
    arXiv, 2021,
  • [26] Linear list r-hued coloring of K4-minor free graphs
    Kong, Jiangxu
    Lai, Hong-Jian
    Xu, Murong
    ARS COMBINATORIA, 2019, 143 : 377 - 391
  • [27] On r-hued list coloring of K4(7)-minor free graphs
    Wei, Wenjuan
    Liu, Fengxia
    Xiong, Wei
    Lai, Hong-Jian
    DISCRETE APPLIED MATHEMATICS, 2022, 309 : 301 - 309
  • [28] A Note on Coloring (4K1, C4, C6)-Free Graphs with a C7
    Koutecky, Martin
    GRAPHS AND COMBINATORICS, 2022, 38 (05)
  • [29] Coloring the cliques of line graphs
    Bacso, Gabor
    Ryjacek, Zdenek
    Tuza, Zsolt
    DISCRETE MATHEMATICS, 2017, 340 (11) : 2641 - 2649
  • [30] Coloring graphs on-line
    Kierstead, HA
    ONLINE ALGORITHMS, 1998, 1442 : 281 - 305
12345