Spanning trees with many leaves
From MaRDI portal
Publication:5890331
DOI10.1002/JGT.1013zbMATH Open0986.05030OpenAlexW4232188574MaRDI QIDQ5890331FDOQ5890331
Authors: Guoli Ding, Thor Johnson, Paul Seymour 
Publication date: 3 June 2002
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.1013
Recommendations
- Spanning trees with many leaves
- Spanning trees with many leaves: lower bounds in terms of the number of vertices of degree 1, 3 and at least 4
- Bounds of the number of leaves of spanning trees
- Spanning Trees with Many Leaves
- Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4
Cites Work
Cited In (49)
- \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs
- Neighborhood unions and extremal spanning trees
- On the signless Laplacian spectral radius of Ks,t-minor free graphs
- The spectral radius of graphs with no \(k_{2,t}\) minor
- On graphs with few disjoint \(t\)-star minors
- Improved bounds for spanning trees with many leaves
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph
- Some results on spanning trees
- The edge-density for \(K_{2,t}\) minors
- The burning number conjecture is true for trees without degree-2 vertices
- Spanning trees: A survey
- Efficiency in exponential time for domination-type problems
- Connected Domination
- On spanning cycles, paths and trees
- On finding directed trees with many leaves
- Hadwiger’s Conjecture
- Balancing two spanning trees
- Minimum degree, leaf number and traceability
- Spanning \(k\)-trees and distance signless Laplacian spectral radius of graphs
- FPT algorithms and kernels for the directed \(k\)-leaf problem
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree
- Spanning trees with leaf distance at least four
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
- 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
- Spanning trees whose stems are spiders
- Bounds on the leaf number in graphs of girth 4 or 5
- Bounds of the number of leaves of spanning trees in graphs without triangles
- Further results on the total monochromatic connectivity of graphs
- Edge tree spanners
- Tree-width and planar minors
- Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait
- Lower bounds on the leaf number in graphs with forbidden subgraphs
- Lower bounds on the number of leaves in spanning trees
- The spanning k-trees, perfect matchings and spectral radius of graphs
- Erdős-Gallai-type results for total monochromatic connection of graphs
- Characterizing spanning trees via the size or the spectral radius of graphs
- Bounds of the number of leaves of spanning trees
- Better Algorithms and Bounds for Directed Maximum Leaf Problems
- Radius, leaf number, connected domination number and minimum degree
- Degree powers in \(K_{s,t}\)-minor free graphs
- Spanning Trees with Many Leaves in Regular Bipartite Graphs
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
- On minimum degree, leaf number, traceability and Hamiltonicity in graphs
- Spanning trees with few leaves
- Rainbow and monochromatic vertex-connection of random graphs
- Spanning trees with few non-leaves
- Title not available (Why is that?)
This page was built for publication: Spanning trees with many leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5890331)
