Pages that link to "Item:Q1162518"
From MaRDI portal
The following pages link to Constructing full spanning trees for cubic graphs (Q1162518):
Displaying 34 items.
- Flow-based formulation for the maximum leaf spanning tree problem (Q324785) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4 (Q744553) (← links)
- Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4 (Q744554) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- Complexities of some interesting problems on spanning trees (Q1041729) (← links)
- Variations of the maximum leaf spanning tree problem for bipartite graphs (Q1045917) (← links)
- Spanning trees in graphs of minimum degree 4 or 5 (Q1196990) (← links)
- An exact algorithm for the maximum leaf spanning tree problem. (Q1413822) (← links)
- Lower bounds on the number of leaves in spanning trees (Q1661497) (← links)
- Leaf number and Hamiltonian \(C_4\)-free graphs (Q1693960) (← links)
- Graphs with forbidden subgraphs and leaf number (Q1715759) (← links)
- Spanning paths in graphs (Q1727750) (← links)
- Bounds of the number of leaves of spanning trees in graphs without triangles (Q1930213) (← links)
- Bounds of the number of leaves of spanning trees (Q1930214) (← links)
- A note on connected domination number and leaf number (Q2099474) (← links)
- Constructing a spanning tree with many leaves (Q2256702) (← links)
- A 3-approximation algorithm for the maximum leaf \(k\)-forest problem (Q2413172) (← links)
- Out-branchings with maximal number of leaves or internal vertices: algorithmic results and open problems (Q2839214) (← links)
- Minimum degree, leaf number and traceability (Q2864428) (← links)
- Connected Domination (Q3384607) (← links)
- Spanning Trees and Domination in Hypercubes (Q3390433) (← links)
- On the analysis of the (1+1) evolutionary algorithm for the maximum leaf spanning tree problem (Q3451414) (← links)
- On Finding Directed Trees with Many Leaves (Q3656853) (← links)
- Bounds on the leaf number in graphs of girth 4 or 5 (Q5035782) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- Lower bounds on the leaf number in graphs with forbidden subgraphs (Q5236058) (← links)
- Spanning Trees with Many Leaves in Regular Bipartite Graphs (Q5387825) (← links)
- A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5443382) (← links)
- Spanning trees with many leaves (Q5890331) (← links)
- Spanning trees with many leaves (Q5919174) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)
- Spanning trees with few non-leaves (Q6076183) (← links)
- Radius, leaf number, connected domination number and minimum degree (Q6110370) (← links)
