Sufficient conditions for spanning trees with constrained leaf distance in a graph
Saved in:
Main Authors: | Hongzhang Chen, Xiaoyun Lv, Jianxi Li, Shou-Jun Xu |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2025-01-01
|
Series: | Discussiones Mathematicae Graph Theory |
Online Access: | https://www.dmgt.uz.zgora.pl/?doi=10.7151/dmgt.2530 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Number of Spanning Trees of Graphs
by: Ş. Burcu Bozkurt, et al.
Published: (2014-01-01) -
Polynomial Time Approximation Schemes for the Constrained Minimum
Spanning Tree Problem
by: Yen Hung Chen
Published: (2012-01-01) -
Spectral Sufficient Conditions on Pancyclic Graphs
by: Guidong Yu, et al.
Published: (2021-01-01) -
Notes on sufficient conditions for a graph to be Hamiltonian
by: Michael Joseph Paul, et al.
Published: (1991-01-01) -
Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
by: Zhen-Mu Hong, et al.
Published: (2021-01-01)