Spanning k-ended trees of 3-regular connected graphs

DOI10.5614/ejgta.2017.5.2.4zbMath1467.05033arXiv1510.05246OpenAlexW2963277322MaRDI QIDQ5006619

Daniel Yaqubi, Hamed Ghasemian Zoeram

Publication date: 16 August 2021

Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1510.05246

zbMATH Keywords

spanning treeconnected graphleaf\(k\)-ended tree3-regular graph

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Related Items (3)

On matching number, decomposition and representation of well-formed graph ⋮ On the minimum leaf number of cubic graphs ⋮ The second least eigenvalue of the signless Laplacian of the complements of trees

Cites Work

• Unnamed Item
• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning trees: A survey
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• A method in graph theory
• On finding spanning trees with few leaves
• Note on Hamilton Circuits
• Independence trees and Hamilton cycles
• Spanning trees of bounded degree

This page was built for publication: Spanning k-ended trees of 3-regular connected graphs