Spanning Trees with Many Leaves in Regular Bipartite Graphs

DOI10.1007/978-3-540-77120-3_78zbMath1193.68190OpenAlexW1573957977MaRDI QIDQ5387825

Emanuele G. Fusco, Angelo Monti

Publication date: 27 May 2008

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77120-3_78

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Related Items

Spanning trees: A survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Complexities of some interesting problems on spanning trees
• Variations of the maximum leaf spanning tree problem for bipartite graphs
• Constructing full spanning trees for cubic graphs
• Spanning trees in graphs of minimum degree 4 or 5
• A short note on the approximability of the maximum leaves spanning tree problem
• Spanning trees with many leaves in cubic graphs
• Spanning Trees with Many Leaves
• Approximating Maximum Leaf Spanning Trees in Almost Linear Time
• The maximum-leaf spanning tree problem: Formulations and facets
• Connected Domination and Spanning Trees with Many Leaves
• Mathematical Foundations of Computer Science 2003
• Spanning trees with many leaves