Constructing a spanning tree with many leaves

DOI10.1007/S10958-011-0611-4MaRDI QIDQ2256702zbMATH OpenOpenAlexFDO

Authors N. V. Gravin

Publication date 20 February 2015

Published in Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10958-011-0611-4

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Spanning Trees with Many Leaves
• Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4
• Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4
• Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
• Spanning trees in graphs of minimum degree 4 or 5

Cites work

• scientific article; zbMATH DE number 2080206 (Why is no real title available?)
• scientific article; zbMATH DE number 3284071 (Why is no real title available?)
• scientific article; zbMATH DE number 3417480 (Why is no real title available?)
• Connected Domination and Spanning Trees with Many Leaves
• Constructing full spanning trees for cubic graphs
• On the approximability of some Maximum Spanning Tree Problems
• Solving connected dominating set faster than \(2^n\)
• Spanning Trees with Many Leaves
• Spanning trees in graphs of minimum degree 4 or 5
• Transversal numbers of uniform hypergraphs

Cited in

(5)

• Spanning trees with many leaves
• Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4
• Spanning trees with few non-leaves
• Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
• Construction of the developing connecting tree

This page was built for publication: Constructing a spanning tree with many leaves

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