Spanning trees with bounded degrees and leaves

DOI10.1016/J.DISC.2015.12.023zbMath1333.05076OpenAlexW2265716027MaRDI QIDQ271638

Zheng Yan, Mikio Kano

Publication date: 7 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2015.12.023

zbMATH Keywords

independence numberspanning treedegree sumleaf

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Cites Work

• Spanning trees with small degrees and few leaves
• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning trees: A survey
• On a \(k\)-tree containing specified leaves in a graph
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Spanning trees with bounded degrees
• Cycles in graphs with prescribed stability number and connectivity
• A note on Hamiltonian circuits
• The independence number condition for the existence of a spanning f-tree

This page was built for publication: Spanning trees with bounded degrees and leaves