The following pages link to Spanning Trees with Many Leaves (Q3360890):
Displayed 50 items.
- The 3-rainbow index and connected dominating sets (Q266041) (← links)
- Upper bounds for the total rainbow connection of graphs (Q328717) (← links)
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- Kernel bounds for path and cycle problems (Q392032) (← links)
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- Max-leaves spanning tree is APX-hard for cubic graphs (Q414465) (← links)
- Confronting intractability via parameters (Q465686) (← 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)
- Some results on spanning trees (Q601948) (← links)
- On graphs with few disjoint \(t\)-star minors (Q648995) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Connected domination number of a graph and its complement (Q659759) (← links)
- The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← 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)
- Spanning trees in graphs of minimum degree 4 or 5 (Q1196990) (← links)
- On the \(r\)-domination number of a graph (Q1197015) (← 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)
- 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)
- Algorithmic meta-theorems for restrictions of treewidth (Q1759681) (← 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)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- Constructing a spanning tree with many leaves (Q2256702) (← links)
- Modifying a graph using vertex elimination (Q2345941) (← links)
- Hardness and approximation results for black hole search in arbitrary networks (Q2382674) (← links)
- The graph motif problem parameterized by the structure of the input graph (Q2403795) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← 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)
- Minimum degree, leaf number and traceability (Q2864428) (← links)
- Kernel Bounds for Path and Cycle Problems (Q2891344) (← links)
- Minimum Degree and Dominating Paths (Q2958208) (← links)
- Connected Domination (Q3384607) (← links)
- Spanning Trees and Domination in Hypercubes (Q3390433) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
- Bounds on the leaf number in graphs of girth 4 or 5 (Q5035782) (← links)