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 条
  • [1] On 2-Connected Spanning Subgraphs with Bounded Degree in K 1,r -Free Graphs
    Kuzel, Roman
    Teska, Jakub
    [J]. GRAPHS AND COMBINATORICS, 2011, 27 (02) : 199 - 206
  • [2] Spanning trees with at most k leaves in 2-connected K1,r-free graphs
    Chen, Guantao
    Chen, Yuan
    Hu, Zhiquan
    Zhang, Shunzhe
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2023, 445
  • [3] Weights of induced subgraphs in K1,r-free graphs
    Pruchnewski, Anja
    Voigt, Margit
    [J]. DISCRETE MATHEMATICS, 2012, 312 (16) : 2429 - 2432
  • [4] Spanning connectivity of K1,r-free split graphs
    Xiong, Wei
    Chen, Xing
    Wu, Yang
    You, Zhifu
    Lai, Hong-Jian
    [J]. DISCRETE APPLIED MATHEMATICS, 2024, 358 : 176 - 183
  • [5] 2-Connected spanning subgraphs of circuit graphs
    Nakamoto, Atsuhiro
    Ozeki, Kenta
    Takahashi, Daiki
    [J]. DISCRETE MATHEMATICS, 2025, 348 (01)
  • [6] 2-Connected spanning subgraphs with low maximum degree in locally planar graphs
    Ellingham, M. N.
    Kawarabayashi, Ken-ichi
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2007, 97 (03) : 401 - 412
  • [7] On 2-connected spanning subgraphs with low maximum degree
    Sanders, DP
    Zhao, Y
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 74 (01) : 64 - 86
  • [8] 2-CONNECTED SPANNING SUBGRAPHS OF PLANAR 3-CONNECTED GRAPHS
    BARNETTE, DW
    [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 1994, 61 (02) : 210 - 216
  • [9] A note on Hamiltonian cycles in K1,r-free graphs
    Li, R
    [J]. ARS COMBINATORIA, 1999, 51 : 199 - 203
  • [10] On hamiltonian properties of K1,r-free split graphs
    Liu, Xia
    Song, Sulin
    Zhan, Mingquan
    Lai, Hong-Jian
    [J]. DISCRETE MATHEMATICS, 2023, 346 (07)
12345