Pages that link to "Item:Q3035303"
From MaRDI portal
The following pages link to Spanning trees with many leaves in cubic graphs (Q3035303):
Displaying 26 items.
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- Spanning trees in graphs of minimum degree 4 or 5 (Q1196990) (← links)
- Lower bounds on the number of leaves in spanning trees (Q1661497) (← 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)
- 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)
- 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)
- A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs (Q5302044) (← 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 in Graphs without Diamonds and Blossoms (Q5458557) (← links)
- Flexible list colorings in graphs with special degeneracy conditions (Q6046649) (← links)
- Flexible List Colorings in Graphs with Special Degeneracy Conditions (Q6065433) (← links)
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree (Q6066463) (← links)
- Spanning trees with few non-leaves (Q6076183) (← links)
