Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices

DOI10.1016/J.DAM.2024.12.004MaRDI QIDQ6671390zbMATH OpenFDO

Authors Xinyu Huang, Zheng Yan

Publication date 27 January 2025

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

Full work available at URL https://doi.org/10.1016/J.DAM.2024.12.004

zbMATH Keywords

bipartite graphbranch vertexleafspanning tree

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• Spanning \(k\)-trees of bipartite graphs
• Spanning \(k\)-ended trees of bipartite graphs
• Degree conditions for graphs to have spanning trees with few branch vertices and leaves
• On a spanning tree with specified leaves in a bipartite graph
• A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph

Cites work

• Degree Conditions for Claw-Free Graphs to Have Spanning Trees with at Most Five Branch Vertices and Leaves in Total
• Degree conditions for graphs to have spanning trees with few branch vertices and leaves
• scientific article; zbMATH DE number 3349867 (Why is no real title available?)
• On spanning trees with few branch vertices
• Spanning \(k\)-ended trees of bipartite graphs
• Spanning trees homeomorphic to a small tree

This page was built for publication: Spanning trees of bipartite graphs with a bounded number of leaves and branch vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671390)