Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs

被引：4
|
作者：
Aboomahigir, Elham [1 ]
Ahanjideh, Milad [2 ]
Akbari, Saieed [3 ]
机构：
[1] Farhangian Univ, Tehran, Iran
[2] 22,4-1 Alley,East Molavi St, Shahrekord, Chaharmahal & B, Iran
[3] Sharif Univ Technol, Dept Math Sci, Tehran, Iran
来源：
DISCRETE APPLIED MATHEMATICS | 2021年 / 296卷
关键词：
Subcubic graph; Hoffmann-Ostenhof's conjecture; Claw-free graph; 4-chordal subcubic graph; Planar graph;
D O I：
10.1016/j.dam.2020.01.016
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
Hoffmann-Ostenhof's conjecture states that the edge set of every connected cubic graph can be decomposed into a spanning tree, a matching and a 2-regular subgraph. In this paper, we show that the conjecture holds for claw-free subcubic graphs and 4-chordal subcubic graphs. (C) 2021 Elsevier B.V. All rights reserved.
引用
收藏
页码：52 / 55
页数：4
相关论文
共 50 条
  • [1] Planarization and Acyclic Colorings of Subcubic Claw-Free Graphs
    Cheng, Christine
    McDermid, Eric
    Suzuki, Ichiro
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2011, 6986 : 107 - 118
  • [2] On Strong Edge-Coloring of Claw-Free Subcubic Graphs
    Jian-Bo Lv
    Jianxi Li
    Xiaoxia Zhang
    [J]. Graphs and Combinatorics, 2022, 38
  • [3] Partitioning Claw-Free Subcubic Graphs into Two Dominating Sets
    Cui, Qing
    [J]. GRAPHS AND COMBINATORICS, 2020, 36 (06) : 1723 - 1740
  • [4] On Strong Edge-Coloring of Claw-Free Subcubic Graphs
    Lv, Jian-Bo
    Li, Jianxi
    Zhang, Xiaoxia
    [J]. GRAPHS AND COMBINATORICS, 2022, 38 (03)
  • [5] Injective edge-coloring of claw-free subcubic graphs
    Cui, Qing
    Han, Zhenmeng
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2024, 47 (05)
  • [6] Partitioning Claw-Free Subcubic Graphs into Two Dominating Sets
    Qing Cui
    [J]. Graphs and Combinatorics, 2020, 36 : 1723 - 1740
  • [7] On maximum P3-packing in claw-free subcubic graphs
    Xi, Wenying
    Lin, Wensong
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2021, 41 (03) : 694 - 709
  • [8] The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs
    Lin, Yuquan
    Lin, Wensong
    [J]. GRAPHS AND COMBINATORICS, 2023, 39 (03)
  • [9] The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs
    Yuquan Lin
    Wensong Lin
    [J]. Graphs and Combinatorics, 2023, 39
  • [10] Decomposing subcubic graphs into claws, paths or triangles
    Bulteau, Laurent
    Fertin, Guillaume
    Labarre, Anthony
    Rizzi, Romeo
    Rusu, Irena
    [J]. JOURNAL OF GRAPH THEORY, 2021, 98 (04) : 557 - 588
12345