A LINEAR TIME ALGORITHM FOR EMBEDDING GRAPHS IN AN ARBITRARY SURFACE (1999)

by Bojan Mohar
Citations:50 - 10 self

Documents Related by Co-Citation

56 The graph genus problem is NP-complete – C Thomassen - 1988
197 Graphs on surfaces – Bojan Mohar, Carsten Thomassen - 2001
224 Efficient planarity testing – John Hopcroft, Robert, Tar Jan - 1974
9 Separating and nonseparating disjoint homotopic cycles in graph embeddings – R Brunet, B Mohar, R B Richter - 1996
38 Finding shortest non-separating and non-contractible cycles for topologically embedded graphs – Sergio Cabello, Bojan Mohar - 2005
307 Topological Graph Theory – J L Gross, T W Tucker - 1987
51 P.: Graph Minors. XVI. Excluding a Non-planar Graph – N Robertson, Seymour - 2003
13 Projective planarity in linear time – B Mohar - 1993
112 A linear algorithm for embedding planar graphs using PQ-trees – N Chiba, T Nishizeki, S Abe, T Ozawa - 1985
32 Depth-first search and Kuratowski subgraphs – S G Williamson - 1984
39 P.: Graph minors. VIII. A Kuratowski Theorem for General Surfaces – N Robertson, Seymour - 1990
250 Graph minors XIII. The disjoint paths problem – N Robertson, P D Seymour - 1995
386 A Separator Theorem for Planar Graphs – Richard J. Lipton, Robert E. Tarjan - 1977
149 A.: Linear time algorithms for NP-hard problems restricted to partial k-trees – S Arnborg, Proskurowski - 1989
78 A Separator Theorem for Graphs of Bounded Genus – J R Gilbert, J P Hutchinson, R E Tarjan - 1984
8 Planar crossing numbers of graphs embeddable in another – Károly J. Böröczky, János Pach, Géza Tóth - 2006
12 Planar decompositions and the crossing number of graphs with an excluded minor – David R. Wood, Jan Arne Telle - 2007
5 Planar crossing numbers of genus g graphs – Hristo Djidjev, Imrich Vrtó - 2006
164 le problem des courbes gauches en topologies”, Fund – “Sur Kuratowski - 1930