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 条
  • [41] EDGE-MAXIMAL GRAPHS WITHOUT theta(2K+1)-GRAPHS
    Jaradat, M. M. M.
    Bataineh, M. S. A.
    Al-Shboul, E. Y. A.
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2014, 11 (01) : 57 - 65
  • [42] GRAPHS WITHOUT K4 AND WELL-QUASI-ORDERING
    THOMAS, R
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1985, 38 (03) : 240 - 247
  • [43] (Δ+1)-total choosability of planar graphs with no cycles of length from 4 to k and without close triangles
    Chang, Gerard J.
    Roussel, Nicolas
    DISCRETE MATHEMATICS, 2012, 312 (14) : 2126 - 2130
  • [44] On the size of (Kt, K1,k)-co-critical graphs
    Davenport, Hunter
    Song, Zi-Xia
    Yang, Fan
    EUROPEAN JOURNAL OF COMBINATORICS, 2022, 104
  • [45] LARGE TRIANGLE-FREE SUBGRAPHS IN GRAPHS WITHOUT K4
    FRANKL, P
    RODL, V
    GRAPHS AND COMBINATORICS, 1986, 2 (02) : 135 - 144
  • [46] Extremal K4-minor-free graphs without short cycles
    Barat, Janos
    PERIODICA MATHEMATICA HUNGARICA, 2023, 86 (01) : 108 - 114
  • [47] Paired versus double domination in K 1,r -free graphs
    Dorbec, Paul
    Hartnell, Bert
    Henning, Michael A.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2014, 27 (04) : 688 - 694
  • [48] Note on the longest paths in {K 1,4, K 1,4 + e}-free graphs
    Duan, Fang
    Wang, Guo Ping
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2012, 28 (12) : 2501 - 2506
  • [49] On the structure and clique-width of ( 4 K 1 , C 4 , C 6 , C 7 )-free graphs
    Penev, Irena
    JOURNAL OF GRAPH THEORY, 2022, 99 (03) : 435 - 460
  • [50] On r-hued coloring of K4-minor free graphs
    Song, Huimin
    Fan, Suohai
    Chen, Ye
    Sun, Lei
    Lai, Hong-Jian
    DISCRETE MATHEMATICS, 2014, 315 : 47 - 52
12345