Bounded degree spanning trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1284, Issue , 1997, Pages 104-117

  Czumaj, Artur ^a   Strothmann, Willy B ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPHIC METHODS; POLYNOMIAL APPROXIMATION;

3-CONNECTED GRAPH; BOUNDED DEGREE; CONNECTED GRAPH; HAMILTONIAN PATH; K-CONNECTED GRAPHS; MAXIMUM DEGREE; POLYNOMIAL-TIME ALGORITHMS; REGULAR GRAPHS;

TREES (MATHEMATICS);

EID: 84949185930     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_9     Document Type: Conference Paper

References (25)

1. D. Barnette. Trees in polyhedral graphs. Canadian J. Mathematics, 18:731-736, 1966.
2. D. Bauer, S. L. Hakimi, and E. F. Sehmeichel. Recognizing tough graphs is NP-hard. Discrete Applied Mathematics, 28:191-195, 1990.
3. B. Bollobás. Extremal Graph Theory. Academic Press, London, 1978.
4. P. M. Camerini, G. Galgiati, and F. Maffioli. Complexity of spanning tree problems, I. European Journal of Operation Research, 5:346-352, 1980.
5. Y. Caro, I. Krasikov, and Y. Roditty. On the largest tree of a given maximum degree in a connected graph. Journal of Graph Theory, 15:7-13, 1991.
6. N. Chiba and T. Nishizeki. The Hamiltonian cycle problem is linear-time solvable for 4- connected planar graphs. Journal of Algorithms, 10:187-211, 1989.
7. M. Fürer and B. Raghavachari. Approximating the minimum-degree Steiner tree to within one of optimal. Journal of Algorithms, 17:409-423, 1994. Also in ACM-SIAM SODA 1992.
8. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, New York, 1979.
9. M. R. Garey, D. S. Johnson, and R. E. Taijan. The planar Hamiltonian circuit problem is NP-complete. SIAM Journal on Computing, 5(4):704-714, 1976.
10. M. X. Goemans and D. P. Williamson. A general approximation technique for constrained forest problems. SIAM Journal on Computing, 24(2):296-317, 1995.
11. H. Nagamochi and T. Ibaraki. A linear-time algorithm for finding a sparse fc-connected spanning subgraph of a fc-connected graph. Algorithmica, 7:583-596, 1992.
12. B. Jackson and T. D. Parsons. On r-regular r-connected non-Hamiltonian graphs. Bulletin of Australian Mathematics Society, 24:205-220, 1981.
13. D. S. Johnson. The NP-completeness column: An ongoing guide. Journal of Algorithms, 6:434-451, 1985.
14. S. Khuller and B. Raghavachari. Improved approximation algorithms for uniform connectivity problems. In Proceedings of the 27 ACM STOC, pp. 1-10, 1995.
15. S. Khuller, B. Raghavachari, and N. Young. Low degree spanning trees of small weight. SIAM Journal on Computing, 25(2):355-368, 1996.
16. S. Khuller and U. Vishkin. Biconnectivity approximations and graph carvings. Journal of the ACM, 41(2):214-235, 1994.
17. T. Lukovski and W.-B. Strothmann. Decremental biconnectivity on planar graphs. Manuscript, 1997.
18. G. H. J. Meredith. Regular n-valent n-connected nonHamiltonian non-n-edge-colorable graphs. Journal of Combinatorial Theory Series B, 14:55-60, 1973.
19. V. Neumann-Lara and E. Rivera-Campo. Spanning trees with bounded degrees. Combinatorica, 11(1):55-61, 1991.
20. C. H. Papadimitriou and M. Yannakakis. The complexity of restricted spanning tree problems. Journal of the ACM, 29(2):285-309, 1982.
21. M. Rauch. Improved data structures for fully dynamic biconnectivity. Full version. A preliminary version appeared in Proceedings of the 26th ACM STOC, 1994.
22. M. Rauch Henzinger and V. King. Fully dynamic biconnectivity and transitive closure. In Proceedings of the 36th IEEE FOCS, pp. 664-673, 1995.
23. D.D. Sleator and R.E. Tarjan. A data structure for dynamic trees. Journal of Computer and System Sciences 26:362-391, 1983.
24. W.-B. Strothmann, Constructing 3-trees in 3-connected planar graphs in linear time. Manuscript, 1996.
25. S. Win. On a connection between the existence of k-trees and the toughness of a graph. Graphs and Combinatorics, 5:201-205, 1989.