Cover Image

Sufficient conditions for spanning $k$-trees in tough graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jia, Caili, Lu, Yong
Format:	Preprint
Published:	2026
Subjects:	Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sufficient conditions for $t$-tough graphs to be Hamiltonian and pancyclic or bipartite
by: Liu, Xiangge, et al.
Published: (2025)

Scattering number and $τ$-toughness in graphs involving $A_α$-spectral radius
by: Jia, Caili, et al.
Published: (2025)

Distance signless Laplacian spectral radius and tough graphs involving minimun degree
by: Liu, Xiangge, et al.
Published: (2025)

The existence of even factors based on the $A_α$-spectral radius of graphs
by: Jia, Caili, et al.
Published: (2025)

Sufficient conditions for fractional $k$-factor-critical graphs with minimum degree to be $k$-factor-critical
by: Zhong, Jiaxu, et al.
Published: (2026)

Sufficient conditions for the variation of toughness under the distance spectral in graphs involving minimum degree
by: Li, Peishan
Published: (2025)

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

A closure result on spanning $k$-trees of graphs with given minimum degree
by: Zhang, Wenqian
Published: (2026)

Degree sequence condition for Hamiltonicity in tough graphs
by: Shan, Songling, et al.
Published: (2024)

The enumeration of odd spanning trees in graphs
by: Xu, Shaohan, et al.
Published: (2026)

On the size of universal graphs for spanning trees
by: Kim, Jaehoon, et al.
Published: (2025)

Discrepancies of spanning trees in dense graphs
by: Hollom, Lawrence, et al.
Published: (2024)

Semidegree threshold for spanning trees in oriented graphs
by: Araújo, Pedro, et al.
Published: (2026)

On the number of distinct spanning trees in pseudorandom graphs
by: Wang, Yiting
Published: (2026)

The Ferrers bound for spanning trees in bipartite graphs
by: Ho, Boon Suan
Published: (2026)

Fan's condition for completely independent spanning trees
by: Ma, Jie, et al.
Published: (2025)

Enumeration of spanning trees and resistance distances of generalized blow-up graphs
by: Liu, Hechao, et al.
Published: (2025)

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

On the number of spanning trees in random regular graphs
by: Greenhill, Catherine, et al.
Published: (2013)

A spectral condition for Hamilton cycles in tough bipartite graphs
by: Ai, Lianyang, et al.
Published: (2025)

Bounded-degree spanning trees in randomly perturbed graphs
by: Krivelevich, Michael, et al.
Published: (2015)

Partitions of complete twisted graphs into plane spanning trees
by: Figueroa, Ana Paulina, et al.
Published: (2025)

Spectral radius, toughness and $k$-factor of graphs
by: Chen, Yuanyuan, et al.
Published: (2026)

A strengthening of a degree sequence condition for Hamiltonicity in tough graphs
by: Shan, Songling, et al.
Published: (2025)

Anticoncentration of random spanning trees in almost regular graphs
by: Lee, Hyunwoo
Published: (2026)

Random minimum spanning tree and dense graph limits
by: Hladký, Jan, et al.
Published: (2023)

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

Some sufficient conditions for a graph with minimum degree to be $k$-critical with respect to $[1,b]$-odd factors
by: Zhong, Jiaxu, et al.
Published: (2026)

Listing spanning trees of outerplanar graphs by pivot-exchanges
by: Behrooznia, Nastaran, et al.
Published: (2024)

Anticoncentration of random spanning trees in graphs with large minimum degree
by: Bitonti, Veronica, et al.
Published: (2026)

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

Sufficient conditions for bipartite rigidity, symmetric completability and hyperconnectivity of graphs
by: Garamvölgyi, Dániel, et al.
Published: (2025)

Sufficient spectral conditions for graphs being $k$-edge-Hamiltonian or $k$-Hamiltonian
by: Li, Yongtao, et al.
Published: (2021)

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

Geometric bounds for spanning tree entropy of planar lattice graphs
by: Champanerkar, Abhijit, et al.
Published: (2025)

Constructions of minimally $t$-tough regular graphs
by: Cheng, Kun, et al.
Published: (2024)

Eigenvalue conditions implying edge-disjoint spanning trees and a forest with constraints
by: Cai, Jin, et al.
Published: (2025)

Spectral conditions of pancyclicity for t-tough graphs
by: Benediktovich, Vladimir I.
Published: (2024)

On the number of spanning trees of bicirculant graphs
by: Yang, Jing, et al.
Published: (2026)

Sufficient conditions for even factors in graphs
by: Zhou, Sizhong, et al.
Published: (2025)