:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Li, Yibo, Dong, Fengming, Liu, Huiqing
Format:	Preprint
Published:	2025
Subjects:	Combinatorics 05C05
Online Access:	https://arxiv.org/abs/2510.07655
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A neighborhood union condition for the existence of a spanning tree without degree $2$ vertices
by: Li, Yibo, et al.
Published: (2024)

Refinements of degree conditions for the existence of a spanning tree without small degree stems
by: Furuya, Michitaka, et al.
Published: (2023)

Existence of trees with prescribed maximum degrees and spectral radii
by: Dong, Fengming, et al.
Published: (2025)

A spectral condition for spanning trees with restricted degrees in bipartite graphs
by: Wu, Jiancheng, et al.
Published: (2024)

Spectral radius and homeomorphically irreducible spanning trees of graphs
by: Gao, Bingqian, et al.
Published: (2025)

A new strategy for finding spanning trees without small degree stems
by: Furuya, Michitaka, et al.
Published: (2023)

Eigenvalues and spanning trees with constrained degree
by: Liu, Chang, et al.
Published: (2023)

A new characterization of the set of Laplacian spectral radii of trees
by: Dong, Fengming, et al.
Published: (2026)

The existence of a spanning tree with leaf distance at least $d$ and leaf degree at most $k$ via the size or the spectral radius with respect to the minimum degree
by: Lin, Jifu, et al.
Published: (2024)

Maximum number of spanning trees and connectivity: Graphs with a fixed minimum degree and bipartite graphs
by: Xu, Shaohan, et al.
Published: (2025)

Maximizing the index of signed complete graphs with spanning trees on $k$ pendant vertices
by: Li, Dan, et al.
Published: (2024)

Odd spanning trees of a graph
by: Zheng, Jingyu, et al.
Published: (2025)

Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
by: Lin, Jifu, et al.
Published: (2024)

Obstructions for normally spanned sets of vertices
by: Lorenz, Nicola, et al.
Published: (2025)

The bipartite analogue of a classical spanning tree enumeration formula, Boolean functions, and their applications to counting odd spanning trees
by: Ge, Jun, et al.
Published: (2026)

Spectral radius conditions for edge-disjoint spanning trees in $(k+c)$-edge-connected graphs
by: Gao, Yongbin, et al.
Published: (2026)

Randomly perturbed digraphs also have bounded-degree spanning trees
by: Morawski, Patryk, et al.
Published: (2023)

A result on spanning trees with bounded total excess
by: Zhou, Sizhong
Published: (2025)

Partial domination of middle graphs
by: Zhang, Shumin, et al.
Published: (2025)

The strong vertex span of trees
by: Grašič, Mateja, et al.
Published: (2024)

Sufficient average degree conditions for the existence of large highly connected subgraphs
by: Krone, Maximilian
Published: (2025)

The absence of monochromatic triangle implies various properly colored spanning trees
by: Li, Ruonan, et al.
Published: (2024)

A study on $T$-equivalent graphs
by: Dong, Fengming, et al.
Published: (2025)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials (III)
by: Dong, Fengming, et al.
Published: (2022)

Comparing list-color functions of uniform hypergraphs with their chromatic polynomials
by: Dong, Fengming, et al.
Published: (2023)

Sufficient minimum degree conditions for the existence of highly connected or edge-connected subgraphs
by: Krone, Maximilian
Published: (2025)

How large part of a graph can be covered by the neighborhoods of k vertices?
by: Pach, Janos
Published: (2026)

On enumeration of spanning trees of complete multipartite graphs containing a fixed spanning forest
by: Wang, Wei, et al.
Published: (2026)

Trees whose even-degree vertices induce a path are antimagic
by: Lozano, Antoni, et al.
Published: (2019)

Spanning trees with large maximum degrees
by: Yan, Jun
Published: (2025)

On the Sombor index of trees with degree restrictions
by: Andriantiana, Eric O. D., et al.
Published: (2024)

The burning number conjecture holds for trees of order $n$ with at most $\left\lfloor \sqrt{n-1}\right\rfloor$ degree-2 vertices
by: Ning, Jiajun, et al.
Published: (2025)

DP color functions of hypergraphs
by: Cui, Ruiyi, et al.
Published: (2025)

Laplacian eigenvalue conditions for edge-disjoint spanning trees and a forest with constraints
by: Gao, Yongbin, et al.
Published: (2026)

A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
by: Erde, Joshua, et al.
Published: (2019)

Embedding loose spanning trees in 3-uniform hypergraphs
by: Pehova, Yanitsa, et al.
Published: (2023)

Effective resistance and spanning trees in complete graphs with distance-class deletions
by: Tamura, Shunya
Published: (2026)

Distance spectral radius conditions for edge-disjoint spanning trees and a forest with constraints
by: Gao, Yongbin, et al.
Published: (2026)

Unbounded degree spanning hypertrees in Dirac hypergraphs
by: Chen, Yaobin, et al.
Published: (2025)

Leaf to leaf path lengths in trees of given degree sequence
by: Rautenbach, Dieter, et al.
Published: (2025)