Spanning trees with many leaves in cubic graphs
From MaRDI portal
Publication:3035303
DOI10.1002/jgt.3190130604zbMath0693.05023MaRDI QIDQ3035303
Daniel J. Kleitman, Jerrold R. Griggs, Aditya Shastri
Publication date: 1989
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: http://purl.umn.edu/4903
Related Items
A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs, Spanning Trees with Many Leaves in Regular Bipartite Graphs, A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs, Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms, Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter, Improved bounds for spanning trees with many leaves, Spanning trees: A survey, Connected domination of regular graphs, Spanning trees in graphs of minimum degree 4 or 5, Bounds of the number of leaves of spanning trees in graphs without triangles, Bounds of the number of leaves of spanning trees