Elimination of local bridges (1997)

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

Documents Related by Co-Citation

11073 Computers and Intractability: A Guide to the Theory of NP-Completeness – M R Garey, D S Johnson - 1979
252 Graph minors. XIII. The disjoint paths problem – N Robertson, P D Seymour - 1995
227 Efficient planarity testing – John Hopcroft, Robert, Tar Jan - 1974
175 TARJAN: Dividing a graph into triconnected components – JOHN E HOPCROFT, E ROBERT - 1973
470 Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms – K Booth, G Lucker - 1976
59 The graph genus problem is NP-complete – C Thomassen - 1989
641 LEDA: A Platform for Combinatorial and Geometric Computing – Kurt Mehlhorn, Stefan Näher, Christian Uhrig - 1999
11 On determing the genus of a graph – L S Filotti, G L Miller, J Reif - 1979
394 A Separator Theorem for Planar Graphs – Richard J. Lipton, Robert E. Tarjan - 1977