Elimination of local bridges (1997)

by Martin Juvan , Bojan Mohar
Venue:Math. Slovaca
Citations:8 - 8 self

Documents Related by Co-Citation

178 Dividing a graph into triconnected components – J E Hopcroft, R E Tarjan - 1973
230 Efficient planarity testing – J E Hopcroft, R E Tarjan - 1974
11 On determining the genus of a graph – I S Filotti, G L Miller, J Reif - 1979
259 Graph minors. XIII. The disjoint paths problem – N Robertson, P D Seymour - 1995
58 graph genus problem is NP-complete – “The Thomassen
21 A depth-first search characterization of planarity – H de Fraysseix, P Rosenstiehl - 1982
19 Embedding graphs in the plane — algorithmic aspects – S G Williamson - 1980
41 Graph minors. VIII. A Kuratowski theorem for general surfaces – N Robertson, P D Seymour - 1990
116 A linear algorithm for embedding planar graphs using PQ-trees,"JCSS 30 – N Chiba, T Nishizeki, S Abe, T Ozawa - 1985
32 Depth-first search and Kuratowski subgraphs – S G Williamson - 1984
56 A linear time algorithm for embedding graphs in an arbitrary surface – Ken-ichi Kawarabayashi, Bojan Mohar, Bruce Reed, Ken-ichi Kawarabayashi, Ken-ichi Kawarabayashi, Bojan Mohar, Bruce Reed - 1999
473 Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms – K Booth, G Lueker - 1976
31 Graph minors. IX. Disjoint crossed paths – N Robertson, P D Seymour - 1990
22 Highly linked graphs, Combinatorica 16 – B Bollobás, A Thomason - 1996
49 Über eine Eigenschaft der ebenen – K Wagner - 1937
20 Existenz n-fach zusammenhängender Teilgraphen in Graphen genügend grosser – W Mader - 1972
18 Typical subgraphs of 3- and 4connected graphs – B Oporowski, J Oxley, R Thomas - 1993
45 personal communication – N Robertson
9 Recent Excluded Minor Theorems for Graphs – Robin Thomas - 1999