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 条
  • [21] Maximum Weight Stable Set on graphs without claw and co-claw (and similar graph classes) can be solved in linear time
    Brandstädt, A
    Mahfud, S
    INFORMATION PROCESSING LETTERS, 2002, 84 (05) : 251 - 259
  • [22] Vertex disjoint copies of K1,4 in claw-free graphs
    Wang, Yun
    Jiang, Suyun
    Yan, Jin
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 393 (393)
  • [23] Disjoint K 4 - in claw-free graphs with minimum degree at least five
    Gao, Yunshu
    Zou, Qingsong
    FRONTIERS OF MATHEMATICS IN CHINA, 2015, 10 (01) : 53 - 68
  • [24] On the Clique-Transversal Number in（Claw,K4 ）-Free 4-Regular Graphs
    Ding Guo WANG
    Er Fang SHAN
    Zuo Song LIANG
    ActaMathematicaSinica(EnglishSeries), 2014, 30 (03) : 505 - 516
  • [25] On the Clique-Transversal Number in (Claw, K4)-Free 4-Regular Graphs
    Wang, Ding Guo
    Shan, Er Fang
    Liang, Zuo Song
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2014, 30 (03) : 505 - 516
  • [26] On the clique-transversal number in (claw, K4)-free 4-regular graphs
    Ding Guo Wang
    Er Fang Shan
    Zuo Song Liang
    Acta Mathematica Sinica, English Series, 2014, 30 : 505 - 516
  • [27] Smallest k-edge-connected claw-free graphs without special spanning trails
    Niu, Zhaohong
    Xiong, Liming
    UTILITAS MATHEMATICA, 2014, 93 : 233 - 248
  • [28] Disjoint K4− in claw-free graphs with minimum degree at least five
    Yunshu Gao
    Qingsong Zou
    Frontiers of Mathematics in China, 2015, 10 : 53 - 68
  • [29] The clique-transversal set problem in {claw, K4}-free planar graphs
    Liang, Zuosong
    Shan, Erfang
    Kang, Liying
    INFORMATION PROCESSING LETTERS, 2017, 118 : 64 - 68
  • [30] Vertex-disjoint copies of K1 + (K1 ∨ K2) in claw-free graphs
    Fujita, Shinya
    DISCRETE MATHEMATICS, 2008, 308 (09) : 1628 - 1633
12345