Degree sum conditions for the existence of homeomorphically irreducible spanning trees

被引:4
|
作者
Ito, Taisei [1 ]
Tsuchiya, Shoichi [1 ]
机构
[1] Senshu Univ, Sch Network & Informat, Kawasaki, Kanagawa, Japan
关键词
homeomorphically irreducible spanning tree; spanning tree;
D O I
10.1002/jgt.22732
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In 1990, Albertson, Berman, Hutchinson, and Thomassen proved a theorem which gives a minimum degree condition for the existence of a spanning tree with no vertices of degree 2. Such a spanning tree is called a homeomorphically irreducible spanning tree (HIST). In this paper, we prove that every graph of order n ( n >= 8) contains a HIST if d ( u ) + d ( v ) >= n - 1 for any nonadjacent vertices u and v. The degree sum condition is best possible.
引用
收藏
页码:162 / 170
页数:9
相关论文
共 50 条
  • [21] Degree Bounded Spanning Trees
    Jun Fujisawa
    Hajime Matsumura
    Tomoki Yamashita
    Graphs and Combinatorics, 2010, 26 : 695 - 720
  • [22] Spanning trees with variable degree bounds
    Gouveia, L.
    Moura, P.
    Ruthmair, M.
    Sousa, A.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 239 (03) : 830 - 841
  • [23] Degree sums and dense spanning trees
    Li, Tao
    Gao, Yingqi
    Dong, Qiankun
    Wang, Hua
    PLOS ONE, 2017, 12 (09):
  • [24] Node degree distribution in spanning trees
    Pozrikidis, C.
    JOURNAL OF PHYSICS A-MATHEMATICAL AND THEORETICAL, 2016, 49 (12)
  • [25] Minimum bounded degree spanning trees
    Goemans, Michel X.
    47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 273 - 282
  • [26] Spanning trees with constraints on the leaf degree
    Kaneko, A
    DISCRETE APPLIED MATHEMATICS, 2001, 115 (1-3) : 73 - 76
  • [27] Distributed Minimum Degree Spanning Trees
    Dinitz, Michael
    Halldorsson, Magnus M.
    Izumi, Taisuke
    Newport, Calvin
    PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, : 511 - 520
  • [28] Sufficient conditions for the existence of spanning colored trees in edge-colored graphs
    Agueda, R.
    Borozan, V.
    Manoussakis, Y.
    Mendy, G.
    Muthu, R.
    DISCRETE MATHEMATICS, 2012, 312 (17) : 2694 - 2699
  • [29] Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves
    Shun-ichi Maezawa
    Ryota Matsubara
    Haruhide Matsuda
    Graphs and Combinatorics, 2019, 35 : 231 - 238
  • [30] Degree Conditions for Graphs to Have Spanning Trees with Few Branch Vertices and Leaves
    Maezawa, Shun-ichi
    Matsubara, Ryota
    Matsuda, Haruhide
    GRAPHS AND COMBINATORICS, 2019, 35 (01) : 231 - 238