Spanning trees with many leaves in graphs with minimum degree three

SIAM Journal on Discrete Mathematics

Volumn 22, Issue 3, 2008, Pages 920-937

  Bonsma, Paul S ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Connected dominating set; Extremal graph theory; Max leaf; Spanning tree

Indexed keywords

CONNECTED DOMINATING SET; CONNECTED GRAPH; EXTREMAL GRAPH THEORY; GRAPH CLASS; LOWER BOUNDS; MAX LEAF; MINIMUM DEGREE; POLYNOMIAL-TIME ALGORITHMS; SPANNING TREE; TRIANGLE-FREE GRAPHS;

AD HOC NETWORKS; CONTROL THEORY; DIAMONDS; MOBILE TELECOMMUNICATION SYSTEMS; POLYNOMIAL APPROXIMATION; SET THEORY;

GRAPH THEORY;

EID: 58349098935     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/060664318     Document Type: Article

References (17)

1. N. Alon, Transversal numbers of uniform hypergraphs, Graphs Combin., 6 (1990), pp. 1-4.
2. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, American Elsevier, New York, 1976.
3. P. S. 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.
4. P. S. Bonsma, T. Brueggemann, and G. J. Woeginger, A faster FPT algorithm for finding spanning trees with many leaves, in MFCS 2003 (Bratislava), Lecture Notes in Comput. Sci. 2747, Springer, Berlin, 2003, pp. 259-268.
5. P. S. Bonsma and F. Zickfeld, Spanning trees with many leaves in graphs without diamonds and blossoms, http://arxiv.org/pdf/0707.2760 (ext. abs. accepted for LATIN 2008), 2007.
6. Y. Caro, D. B. West, and R. Yuster, Connected domination and spanning trees with many leaves, SIAM J. Discrete Math., 13 (2000), pp. 202-211.
7. J. R. Correa, C. G. Fernandes, M. Matamala, and Y. Wakabayashi, A 5/3-approximation for finding spanning trees with many leaves in cubic graphs, in Approximation and Online Algorithms, Proceedings of WAOA 2007, Lecture Notes in Comput. Sci. 4927, C. Kaklamanis and M. Skutella, eds., Springer, Berlin, 2008, pp. 184-192.
8. V. Estivill-Castro, M. R. Fellows, M. A. Langston, and F. A. Rosamond, FPT is P-time extremal structure I, in ACiD 2005 (Durham), vol. 4 of Texts in Algorithmics, London, 2005, King's College Publications, pp. 1-41.
9. M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman, San Francisco, 1979.
10. J. R. Griggs, D. J. Kleitman, and A. Shastri, Spanning trees with many leaves in cubic graphs, J. Graph Theory, 13 (1989), pp. 669-695.
11. J. R. GRIGGS and M. Wu, Spanning trees in graphs of minimum degree 4 or 5, Discrete Math., 104 (1992), pp. 167-183.
12. S. GUHA and S. Khuller, Approximation algorithms for connected dominating sets, Algorithmica, 20 (1998), pp. 374-387.
13. D. J. Kleitman and D. B. West, Spanning trees with many leaves, SIAM J. Discrete Math., 4 (1991), pp. 99-106.
14. N. Linial and D. Sturtevant, 1987, unpublished.
15. H. Lu and R. Ravi, Approximating maximum leaf spanning trees in almost linear time, J. Algorithms, 29 (1998), pp. 132-141.
16. L. Ruan, H. Du, X. Jia, W. Wu, Y. Li, and K. Ko, A greedy approximation for minimum connected dominating sets, Theoret. Comput. Sci., 329 (2004), pp. 325-330.
17. R. Solis-Oba, 2-approximation algorithm for finding a spanning tree with maximum number of leaves, in Algorithms-ESA '98 (Venice), Lecture Notes in Comput. Sci. 1461, Springer, Berlin, 1998, pp. 441-452.