On the Structure of Graphs Without Claw, 4K1 and co-R

被引：0
|
作者：
Abuadas, Tala [1 ]
Hoang, Chinh T. [1 ]
机构：
[1] Wilfrid Laurier Univ, Dept Phys & Comp Sci, Waterloo, ON, Canada
来源：
GRAPHS AND COMBINATORICS | 2022年 / 38卷 / 04期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Graph coloring; Line-graph; Claw; Co-R; Clique width; CLIQUE-WIDTH;
D O I：
10.1007/s00373-022-02517-8
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Given a family F of graphs, a graph G is F-free if it does not contain any graph in F as an induced subgraph. The problem of determining the complexity of vertex coloring (claw, 4K(1))-free graphs is a well known open problem. In this paper, we solve the coloring problem for a subclass of (claw, 4K(1))-free graphs. We design a polynomial-time algorithm to color (claw, 4K(1), co-R)-free graphs. This algorithm is derived from a structural theorem on (claw, 4K(1), co-R)-free graphs.
引用
收藏
页数：19
相关论文
共 50 条
  • [31] Cycles in 3-connected claw-free planar graphs and 4-connected planar graphs without 4-cycles
    Lo, On-Hei Solomon
    JOURNAL OF GRAPH THEORY, 2024, 107 (04) : 702 - 728
  • [32] HAMILTONICITY FOR K1,(R)-FREE GRAPHS
    CHEN, G
    SCHELP, RH
    JOURNAL OF GRAPH THEORY, 1995, 20 (04) : 423 - 439
  • [33] Maximal K3's and Hamiltonicity of 4-connected claw-free graphs
    Fujisawa, Jun
    Ota, Katsuhiro
    JOURNAL OF GRAPH THEORY, 2012, 70 (01) : 40 - 53
  • [34] Recognizing the P4-structure of claw-free graphs and a larger graph class
    Babel, L
    Brandstädt, A
    Le, V
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2002, 5 (01): : 127 - 146
  • [35] Disjoint K1,4 in claw-free graphs with minimum degree at least four∗
    1600, Charles Babbage Research Centre (103):
  • [36] ON THE INDEPENDENCE NUMBER IN K-1,K-R+1-FREE GRAPHS
    RYJACEK, Z
    SCHIERMEYER, I
    DISCRETE MATHEMATICS, 1995, 138 (1-3) : 365 - 374
  • [37] Hyper K1,r and sub-K1,r fault tolerance of star graphs
    Yang, Yuxing
    Hua, Xiaohui
    Yang, Lulu
    DISCRETE APPLIED MATHEMATICS, 2023, 339 : 172 - 177
  • [38] On the structure of k-connected graphs without Kk-minor
    Kawarabayashi, K
    Luo, R
    Niu, JB
    Zhang, CQ
    EUROPEAN JOURNAL OF COMBINATORICS, 2005, 26 (3-4) : 293 - 308
  • [39] Minimizing the number of edges in (C4, K1,k)-co-critical graphs
    Chen, Gang
    Ren, Chenchen
    Song, Zi-Xia
    DISCRETE MATHEMATICS, 2025, 348 (05)
  • [40] List-coloring graphs without K4,k-minors
    Kawarabayashi, Ken-ichi
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (04) : 659 - 662
12345