On 2-Connected Spanning Subgraphs with Bounded Degree in K1,r-Free Graphs

被引：0
|
作者：
Roman Kužel
Jakub Teska
机构：
[1] University of West Bohemia,Department of Mathematics
[2] Charles University,Institute for Theoretical Computer Science
来源：
Graphs and Combinatorics | 2011年 / 27卷
关键词：
Trestle; Hamiltonian cycle; -free; 2-Connected graph;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
For any integer r > 1, an r-trestle of a graph G is a 2-connected spanning subgraph F with maximum degree Δ(F) ≤ r. A graph G is called K1,r-free if G has no K1,r as an induced subgraph. Inspired by the work of Ryjáček and Tkáč, we show that every 2-connected K1,r-free graph has an r-trestle. The paper concludes with a corollary of this result for the existence of k-walks.
引用
收藏
页码：199 / 206
页数：7
相关论文
共 50 条
  • [31] On weights of induced paths and cycles in claw-free and K1,r-free graphs
    Harant, J
    Voigt, M
    Jendrol', S
    Randerath, B
    Ryjácek, Z
    Schiermeyer, I
    [J]. JOURNAL OF GRAPH THEORY, 2001, 36 (03) : 131 - 143
  • [32] Almost-spanning subgraphs with bounded degree in dense graphs
    Ishigami, Y
    [J]. EUROPEAN JOURNAL OF COMBINATORICS, 2002, 23 (05) : 583 - 612
  • [33] On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality
    Böckenhauer, HJ
    Bongartz, D
    Hromkovic, J
    Klasing, R
    Proietti, G
    Seibert, S
    Unger, W
    [J]. THEORETICAL COMPUTER SCIENCE, 2004, 326 (1-3) : 137 - 153
  • [34] Chordal 2-Connected Graphs and Spanning Trees
    Bogdanowicz, Zbigniew R.
    [J]. JOURNAL OF GRAPH THEORY, 2014, 76 (03) : 224 - 235
  • [35] ON IMPLICIT HEAVY SUBGRAPHS AND HAMILTONICITY OF 2-CONNECTED GRAPHS
    Zheng, Wei
    Widel, Wojciech
    Wang, Ligong
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2021, 41 (01) : 167 - 181
  • [36] PAIRS OF HEAVY SUBGRAPHS FOR HAMILTONICITY OF 2-CONNECTED GRAPHS
    Li, Binlong
    Ryjacek, Zdenek
    Wang, Ying
    Zhang, Shenggui
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (03) : 1088 - 1103
  • [37] UNAVOIDABLE INDUCED SUBGRAPHS OF LARGE 2-CONNECTED GRAPHS
    Allred, Sarah
    Ding, Guoli
    Oporowski, Bogdan
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 684 - 698
  • [38] Pairs of forbidden subgraphs and 2-connected supereulerian graphs
    Cada, Roman
    Ozeki, Kenta
    Xiong, Liming
    Yoshimoto, Kiyoshi
    [J]. DISCRETE MATHEMATICS, 2018, 341 (06) : 1696 - 1707
  • [39] A characterization of 2-connected {K1,3, N3,1,1}-free non-Hamiltonian graphs
    Chiba, Shuya
    Furuya, Michitaka
    [J]. DISCRETE MATHEMATICS, 2021, 344 (05)
  • [40] A TRIPLE OF HEAVY SUBGRAPHS ENSURING PANCYCLICITY OF 2-CONNECTED GRAPHS
    Widel, Wojciech
    [J]. DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (02) : 477 - 500
12345