Spanning trees in graphs of minimum degree 4 or 5
From MaRDI portal
Publication:1196990
DOI10.1016/0012-365X(92)90331-9zbMath0776.05031OpenAlexW2064084823MaRDI QIDQ1196990
Jerrold R. Griggs, Mingshen Wu
Publication date: 16 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90331-9
Related Items
The 3-rainbow index and connected dominating sets ⋮ Bounds on the leaf number in graphs of girth 4 or 5 ⋮ A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6 ⋮ FPT algorithms and kernels for the directed \(k\)-leaf problem ⋮ Bounds on domination parameters in graphs: a brief survey ⋮ Upper bounds for the total rainbow connection of graphs ⋮ Lower bounds on the number of leaves in spanning trees ⋮ Further results on the total monochromatic connectivity of graphs ⋮ Robust Connectivity of Graphs on Surfaces ⋮ Hamiltonicity, minimum degree and leaf number ⋮ 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 ⋮ Spanning Trees and Domination in Hypercubes ⋮ Minimum Degree and Dominating Paths ⋮ Max-leaves spanning tree is APX-hard for cubic graphs ⋮ Leaf number and Hamiltonian \(C_4\)-free graphs ⋮ Average distance and connected domination ⋮ Improved pyrotechnics: closer to the burning number conjecture ⋮ On spanning trees without vertices of degree 2 in plane triangulations ⋮ Graphs with forbidden subgraphs and leaf number ⋮ On spanning cycles, paths and trees ⋮ Spanning Trees with Many Leaves in Regular Bipartite Graphs ⋮ Spanning paths in graphs ⋮ Spanning trees: A survey ⋮ Connected domination number of a graph and its complement ⋮ On minimum degree, leaf number, traceability and Hamiltonicity in graphs ⋮ A 2-approximation algorithm for finding a spanning tree with maximum number of leaves ⋮ On the \(r\)-domination number of a graph ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ Bounds on the connected forcing number of a graph ⋮ Constructing a spanning tree with many leaves ⋮ Spanning trees with many leaves ⋮ Better Algorithms and Bounds for Directed Maximum Leaf Problems ⋮ 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 ⋮ Note on the vertex-rainbow index of a graph ⋮ Spanning trees with many leaves ⋮ Connected Domination ⋮ Connected domination of regular graphs ⋮ Lower bounds on the leaf number in graphs with forbidden subgraphs ⋮ Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems ⋮ A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs ⋮ A note on connected domination number and leaf number ⋮ Minimum degree, leaf number and traceability
Cites Work
