Spanning \(k\)-ended trees of bipartite graphs

DOI10.1016/j.disc.2013.09.002zbMath1281.05050OpenAlexW1980905758MaRDI QIDQ394291

Haruhide Matsuda, Mikio Kano, Masao Tsugaki, Gui Ying Yan

Publication date: 27 January 2014

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

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

zbMATH Keywords

spanning treespanning \(k\)-ended treespanning tree with at most \(k\) leaves

Mathematics Subject Classification ID

Trees (05C05)

Related Items

A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph, Rainbow and properly colored spanning trees in edge-colored bipartite graphs

Cites Work

• Unnamed Item
• Factors and factorizations of graphs. Proof techniques in factor theory
• Spanning trees: A survey
• Spanning trees with bounded degrees
• On Hamiltonian bipartite graphs
• Note on Hamilton Circuits
• Independence trees and Hamilton cycles
• Spanning trees of bounded degree