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

来源：

DISCRETE MATHEMATICS | 2025年 / 348卷 / 02期

关键词：

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 条

[41] Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
Biniaz, Ahmad
DISCRETE & COMPUTATIONAL GEOMETRY, 2022, 67 (01) : 311 - 327
[42] Heuristic algorithm for degree-constrained minimum spanning tree
Liao, Fei-Xiong
Ma, Liang
Shanghai Ligong Daxue Xuebao/Journal of University of Shanghai for Science and Technology, 2007, 29 (02): : 142 - 144
[43] Low-degree spanning trees of small weight
Khuller, S
Raghavachari, B
Young, N
SIAM JOURNAL ON COMPUTING, 1996, 25 (02) : 355 - 368
[44] Self-stabilizing minimum-degree spanning tree within one from the optimal degree
Blin, Lelia
Potop-Butucaru, Maria Gradinariu
Rovedakis, Stephane
2009 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING, VOLS 1-5, 2009, : 668 - +
[45] Neighbourhood and degree conditions for the existence of regular factors
Lenkewitz, U
Volkmann, L
ARS COMBINATORIA, 1996, 42 : 33 - 47
[46] Existence of Spanning F-Free Subgraphs with Large Minimum Degree
Perarnau, G.
Reed, B.
COMBINATORICS PROBABILITY & COMPUTING, 2017, 26 (03): : 448 - 467
[47] On Spanning Trees without Vertices of Degree 2 in Plane Triangulations
Karpov D.V.
Journal of Mathematical Sciences, 2020, 247 (3) : 438 - 441
[48] Nets of small degree without ovals
Drake, DA
Myrvold, W
DESIGNS CODES AND CRYPTOGRAPHY, 2004, 32 (1-3) : 167 - 183
[49] Nets of Small Degree Without Ovals
David A. Drake
Wendy Myrvold
Designs, Codes and Cryptography, 2004, 32 : 167 - 183
[50] Fuzzy random degree-constrained minimum spanning tree problem
Liu, Wei
Yang, Chengjing
INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS, 2007, 15 (02) : 107 - 115

← 1 2 3 4 5 →