Constructing a spanning tree with many leaves

DOI10.1007/S10958-011-0611-4zbMATH Open1402.05200OpenAlexW2094152042MaRDI QIDQ2256702FDOQ2256702

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)

Cites Work

• Spanning trees in graphs of minimum degree 4 or 5
• On the approximability of some Maximum Spanning Tree Problems
• Transversal numbers of uniform hypergraphs
• Spanning Trees with Many Leaves
• Connected Domination and Spanning Trees with Many Leaves
• Title not available (Why is that?)
• Constructing full spanning trees for cubic graphs
• Solving connected dominating set faster than \(2^n\)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (2)

• Spanning trees with many leaves
• Construction of the developing connecting tree

   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 👍 👎

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)