Improved bounds for spanning trees with many leaves-Reference-Cited by-同舟云学术

Improved bounds for spanning trees with many leaves

Published:2012-03 Issue:6 Volume:312 Page:1178-1194
ISSN:0012-365X
Container-title:Discrete Mathematics
language:en
Short-container-title:Discrete Mathematics

Author:

Bonsma Paul,Zickfeld Florian

Funder

Graduate School “Methods for Discrete Structures”

Studienstiftung des Deutschen Volkes

Publisher

Elsevier BV

Subject

Discrete Mathematics and Combinatorics,Theoretical Computer Science

Reference19 articles.

1. P. Bonsma, Sparse cuts, matching-cuts and leafy trees in graphs, Ph.D. Thesis, University of Twente, Enschede, the Netherlands, 2006. http://purl.org/utwente/57117.

2. Spanning trees with many leaves in graphs with minimum degree three;Bonsma;SIAM J. Discrete Math.,2008

3. A faster FPT algorithm for finding spanning trees with many leaves;Bonsma,2003

4. A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs;Bonsma;SIAM J. Discrete Math.,2011

5. Spanning trees with many leaves in graphs without diamonds and blossoms (extended abstract);Bonsma,2008

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Spanning trees with few non-leaves;Israel Journal of Mathematics;2023-09

2. A Simple 2-Approximation for Maximum-Leaf Spanning Tree;International Journal of Foundations of Computer Science;2023-05-29

3. Flexible list colorings in graphs with special degeneracy conditions;Journal of Graph Theory;2022-06-20

4. Connected Domination;Topics in Domination in Graphs;2020

5. On the Parameterized Complexity of Spanning Trees with Small Vertex Covers;Algorithms and Discrete Applied Mathematics;2020