Constructing full spanning trees for cubic graphs
From MaRDI portal
Publication:1162518
DOI10.1016/0020-0190(81)90141-1zbMath0482.05031OpenAlexW2078178103MaRDI QIDQ1162518
Publication date: 1981
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(81)90141-1
Related Items (34)
Bounds on the leaf number in graphs of girth 4 or 5 ⋮ On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem ⋮ Flow-based formulation for the maximum leaf spanning tree problem ⋮ Lower bounds on the number of leaves in spanning trees ⋮ Robust Connectivity of Graphs on Surfaces ⋮ A 3-approximation algorithm for the maximum leaf \(k\)-forest problem ⋮ Bounds of the number of leaves of spanning trees in graphs without triangles ⋮ Bounds of the number of leaves of spanning trees ⋮ A Simple 2-Approximation for Maximum-Leaf Spanning Tree ⋮ Spanning trees with few non-leaves ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ Spanning Trees and Domination in Hypercubes ⋮ Leaf number and Hamiltonian \(C_4\)-free graphs ⋮ An exact algorithm for the maximum leaf spanning tree problem. ⋮ Graphs with forbidden subgraphs and leaf number ⋮ Spanning Trees with Many Leaves in Regular Bipartite Graphs ⋮ Spanning paths in graphs ⋮ A 2-approximation algorithm for finding a spanning tree with maximum number of leaves ⋮ Spanning trees in graphs of minimum degree 4 or 5 ⋮ Constructing a spanning tree with many leaves ⋮ Spanning trees with many leaves ⋮ A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs ⋮ 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 ⋮ 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 ⋮ On Finding Directed Trees with Many Leaves ⋮ Complexities of some interesting problems on spanning trees ⋮ Variations of the maximum leaf spanning tree problem for bipartite graphs ⋮ A note on connected domination number and leaf number ⋮ Minimum degree, leaf number and traceability
Cites Work
This page was built for publication: Constructing full spanning trees for cubic graphs
