Refinements of degree conditions for the existence of a spanning tree without small degree stems

被引:0
|
作者
Furuya, Michitaka [1 ]
Saito, Akira [2 ]
Tsuchiya, Shoichi [3 ]
机构
[1] Kitasato Univ, Coll Liberal Arts & Sci, Kitasato 1-15-1,Minami Ku, Sagamihara, Kanagawa 2520373, Japan
[2] Nihon Univ, Dept Informat Sci, Sakurajosui 3-25-40,Setagaya Ku, Tokyo 1568550, Japan
[3] Senshu Univ, Sch Network & Informat, 2-1-1 Higashimita,Tama Ku, Kawasaki, Kanagawa 2148580, Japan
关键词
Homeomorphically irreducible spanning; tree (HIST); Minimum degree; Degree-sum; 2; k; ST;
D O I
10.1016/j.disc.2024.114307
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A spanning tree of a graph without vertices of degree 2 is called a homeomorphically irreducible spanning tree (or a HIST) of the graph. Albertson et al. (1990) [1] gave a minimum degree condition for the existence of a HIST, and recently, Ito and Tsuchiya (2022) [11] found a sharp degree-sum condition for the existence of a HIST. In this paper, we refine these results, and extend the first one to a spanning tree in which no vertex other than the endvertices has small degree. (c) 2024 Published by Elsevier B.V.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] Forbidden subgraphs and the existence of a spanning tree without small degree stems
    Furuya, Michitaka
    Tsuchiya, Shoichi
    DISCRETE MATHEMATICS, 2013, 313 (20) : 2206 - 2212
  • [2] A neighborhood union condition for the existence of a spanning tree without degree 2 vertices
    Li, Yibo
    Dong, Fengming
    Hu, Xiaolan
    Liu, Huiqing
    arXiv,
  • [3] Degree sum conditions for the existence of homeomorphically irreducible spanning trees
    Ito, Taisei
    Tsuchiya, Shoichi
    JOURNAL OF GRAPH THEORY, 2022, 99 (01) : 162 - 170
  • [4] Degree Conditions for Spanning Brooms
    Chen, Guantao
    Ferrara, Michael
    Hu, Zhiquan
    Jacobson, Michael
    Liu, Huiqing
    JOURNAL OF GRAPH THEORY, 2014, 77 (03) : 237 - 250
  • [5] A Spanning Tree with High Degree Vertices
    Ozeki, Kenta
    Yamashita, Tomoki
    GRAPHS AND COMBINATORICS, 2010, 26 (04) : 591 - 596
  • [6] On stability of spanning tree degree enumerators
    Cherkashin, Danila
    Petrov, Fedor
    Prozorov, Pavel
    DISCRETE MATHEMATICS, 2023, 346 (12)
  • [7] A Spanning Tree with High Degree Vertices
    Kenta Ozeki
    Tomoki Yamashita
    Graphs and Combinatorics, 2010, 26 : 591 - 596
  • [8] Optimal Degree Conditions for Spanning Subgraphs
    Arizona State University
  • [9] The full-degree spanning tree problem
    Bhatia, R
    Khuller, S
    Pless, R
    Sussmann, YJ
    NETWORKS, 2000, 36 (04) : 203 - 209
  • [10] On stability of weighted spanning tree degree enumerators
    Prozorov, P. K.
    Cherkashin, D. D.
    IZVESTIYA MATHEMATICS, 2025, 89 (01) : 106 - 124