Pages that link to "Item:Q1196990"
From MaRDI portal
The following pages link to Spanning trees in graphs of minimum degree 4 or 5 (Q1196990):
Displayed 47 items.
- The 3-rainbow index and connected dominating sets (Q266041) (← links)
- Upper bounds for the total rainbow connection of graphs (Q328717) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- On minimum degree, leaf number, traceability and Hamiltonicity in graphs (Q512550) (← 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 number of a graph and its complement (Q659759) (← 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)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- Connected domination of regular graphs (Q1025488) (← links)
- On the \(r\)-domination number of a graph (Q1197015) (← links)
- Lower bounds on the number of leaves in spanning trees (Q1661497) (← links)
- Hamiltonicity, minimum degree and leaf number (Q1677599) (← 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)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← 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)
- Note on the vertex-rainbow index of a graph (Q2048994) (← links)
- A note on connected domination number and leaf number (Q2099474) (← links)
- Bounds on domination parameters in graphs: a brief survey (Q2151205) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- On spanning trees without vertices of degree 2 in plane triangulations (Q2202674) (← links)
- Constructing a spanning tree with many leaves (Q2256702) (← links)
- On spanning cycles, paths and trees (Q2446869) (← links)
- A bound on the number of leaves in a spanning tree of a connected graph of minimum degree 6 (Q2632551) (← 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)
- Minimum Degree and Dominating Paths (Q2958208) (← links)
- Connected Domination (Q3384607) (← links)
- Spanning Trees and Domination in Hypercubes (Q3390433) (← 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)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
- Spanning trees with many leaves (Q5890331) (← links)
- Spanning trees with many leaves (Q5919174) (← links)
- Spanning trees with few non-leaves (Q6076183) (← links)
- Radius, leaf number, connected domination number and minimum degree (Q6110370) (← links)
- Average distance and connected domination (Q6166238) (← links)
- Improved pyrotechnics: closer to the burning number conjecture (Q6197306) (← links)