Independent Trees in . . .

Independent Trees in . . . (2003)

Cached

Download Links

[www.math.gatech.edu]

by Sean P. Curran

BibTeX

@MISC{Curran03independenttrees,
    author = {Sean P. Curran},
    title = {Independent Trees in . . . },
    year = {2003}
}

Bookmark

OpenURL

Abstract

Citations

557	Data Structures and Network Algorithms - Tarjan - 1983
540	Introduction to Algorithms, Second Edition - Cormen, Leiserson, et al. - 2001
314	How to draw a graph - Tutte - 1962
193	Tarjan, Efficient planarity testing - Hopcroft, E - 1974
59	Embeddings of graphs - Thomassen - 1994
48	The multi-tree approach to reliability in distributed networks - Itai, Rodeh - 1988
37	A theorem on paths in planar graphs - Thomassen - 1983
36	A polynomial solution to the undirected two paths problem - Shiloach - 1980
35	A linear-time algorithm for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7 - Nagamochi, Ibaraki - 1992
25	Finding non-separating induced cycle and independent spanning trees in 3-connected graphs - Cheriyan, Maheshwari - 1988
22	The Hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs - CHIBA, NISHIZEKI - 1989
22	A new look at fault tolerant network routing - Dolev, Halpern, et al. - 1984
21	Three tree-paths - Zehavi, Itai - 1989
16	A new planarity test - Shih, Hsu - 1999
12	Independent trees in graphs - Huck - 1994
10	Covering three edges with a bond in a nonseparable graph - Charkravarti, Robertson - 1979
8	Induced paths in 5-connected graphs - Kriesell - 1975
4	Graph connectivity after path removal - Chen, Gould, et al.
4	A linear-time algorithm to find four independent spanning trees in four connected planar graphs - Miura, Nakano, et al. - 1999
3	Finding two disjoint paths between pairs of vertices in a graph - Perl, Shiloach - 1978
3	Disjoint paths in planar graphs - Seymour - 1980
3	On the existence of certain disjoint arcs in graphs - Watkins - 1968
2	Non-separating cycles in 4-connected graphs - Curran, Yu
2	Chain decompositions of 4-connected graphs - Curran, Lee, et al. - 2002
2	Dividing a graph into three connected components - Hopcroft, Tarjan - 1973