Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
From MaRDI portal
Publication:3393426
DOI10.1137/060664318zbMath1181.05051OpenAlexW2020354668MaRDI QIDQ3393426
Publication date: 20 August 2009
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060664318
Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Bounds on the leaf number in graphs of girth 4 or 5, Lower bounds on the number of leaves in spanning trees, Bounds of the number of leaves of spanning trees in graphs without triangles, Bounds of the number of leaves of spanning trees, Spanning trees with few non-leaves, Improved bounds for spanning trees with many leaves, Radius, leaf number, connected domination number and minimum degree, Graphs with forbidden subgraphs and leaf number, On graphs with few disjoint \(t\)-star minors, A new algorithm for finding trees with many leaves, Spanning trees: A survey, 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, Connected Domination, Lower bounds on the leaf number in graphs with forbidden subgraphs, A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs, A note on connected domination number and leaf number
