Independent trees in planar graphs independent trees

Graphs and Combinatorics

Volumn 15, Issue 1, 1999, Pages 29-77

  Huck, Andreas ^a  

^a LEIBNIZ UNIVERSITY HANNOVER   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347805740     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. Cheriyan, J., Maheshwari, S.N.: Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs. Journal of Algorithms 9, 507-537 (1988)
2. Edmonds, J.: Submodular functions, matroids and certain polyhedra. Combinatorial Structures and Their Applications, R. Guy et al, Eds., Gordon and Breach, New York, 69-87 (1969)
3. Huck, A.: Independent trees in graphs. Graphs Comb. 10, 29-45 (1994)
4. Huck, A.: Disproof of a conjecture about independent branchings in k-connected directed graphs. J. Graph Theory 20, 235-239 (1995)
5. Itai, A., Rodeh, R.: The multi-tree approach to reliability in distributed networks. Proceedings 25th Annual IEEE Symposium on Foundations of Computer Sciences, 137-147 (1984)
6. Khuller S., Schieber, B.: On independent spanning trees. Inform. Process. Lett. 42 (6), 321-323 (1992)
7. Whitty, R. W.: Vertex-disjoint paths and edge-disjoint branchings in directed graphs. J. Graph Theory 11, 349-358 (1987)
8. Zehavi, A., Itai, A.: Three tree-paths. J. Graph Theory 13, 175-188 (1989)