Spanning trees with many leaves
From MaRDI portal
Publication:5890331
DOI10.1002/jgt.1013zbMath0986.05030OpenAlexW4232188574MaRDI QIDQ5890331
Thor Johnson, Guoli Ding, P. D. 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
Related Items (37)
Bounds on the leaf number in graphs of girth 4 or 5 ⋮ The spanning k-trees, perfect matchings and spectral radius of graphs ⋮ FPT algorithms and kernels for the directed \(k\)-leaf problem ⋮ Lower bounds on the number of leaves in spanning trees ⋮ Further results on the total monochromatic connectivity of graphs ⋮ The spectral radius of graphs with no \(k_{2,t}\) minor ⋮ Spectral extrema of \(K_{s,t}\)-minor free graphs -- on a conjecture of M. Tait ⋮ Some results on spanning trees ⋮ Bounds of the number of leaves of spanning trees in graphs without triangles ⋮ Bounds of the number of leaves of spanning trees ⋮ The edge-density for \(K_{2,t}\) minors ⋮ A Simple 2-Approximation for Maximum-Leaf Spanning Tree ⋮ Spanning trees with few non-leaves ⋮ Improved bounds for spanning trees with many leaves ⋮ Radius, leaf number, connected domination number and minimum degree ⋮ \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs ⋮ On graphs with few disjoint \(t\)-star minors ⋮ On spanning cycles, paths and trees ⋮ Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree ⋮ Spanning Trees with Many Leaves in Regular Bipartite Graphs ⋮ Spanning trees: A survey ⋮ On minimum degree, leaf number, traceability and Hamiltonicity in graphs ⋮ Some extremal results on the colorful monochromatic vertex-connectivity of a graph ⋮ Tree-width and planar minors ⋮ Efficiency in exponential time for domination-type problems ⋮ On the signless Laplacian spectral radius of Ks,t-minor free graphs ⋮ Better Algorithms and Bounds for Directed Maximum Leaf Problems ⋮ 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 ⋮ Connected Domination ⋮ Hadwiger’s Conjecture ⋮ Erdős-Gallai-type results for total monochromatic connection of graphs ⋮ Lower bounds on the leaf number in graphs with forbidden subgraphs ⋮ Degree powers in \(K_{s,t}\)-minor free graphs ⋮ On Finding Directed Trees with Many Leaves ⋮ Rainbow and monochromatic vertex-connection of random graphs ⋮ Minimum degree, leaf number and traceability
Cites Work
This page was built for publication: Spanning trees with many leaves
