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

by Bojan Mohar
Citations:50 - 10 self

Documents Related by Co-Citation

58 graph genus problem is NP-complete – “The Thomassen
212 Graphs on surfaces – Bojan Mohar, Bojan Mohar - 2001
230 Efficient planarity testing – J E Hopcroft, R E Tarjan - 1974
311 Handbook of graph theory – J L Gross, J Yellen - 2003
13 Projective planarity in linear time – B Mohar - 1993
9 Separating and nonseparating disjoint homotopic cycles in graph embeddings – R Brunet, B Mohar, R B Richter - 1996
43 Finding shortest non-separating and non-contractible cycles for topologically embedded graphs – Sergio Cabello, Bojan Mohar - 2005
32 Depth-first search and Kuratowski subgraphs – S G Williamson - 1984
159 Linear time algorithms for NP-hard problems restricted to partial k-trees – S Arnborg, A Proskurowski - 1989
397 A Separator Theorem for Planar Graphs f – Richard J. Lipton, Robert E. Tarjan - 1977
259 Graph minors. XIII. The disjoint paths problem – N Robertson, P D Seymour - 1995
55 Graph minors. XVI. Excluding a non-planar graph, preprint – N Robertson, P D Seymour - 1986
79 Tarjan, A separator theorem for graphs of bounded genus – J R Gilbert, J P Hutchinson, R E - 1984
166 Sur le problème des courbes gauches en topologie – K Kuratowski - 1930
473 Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms – K Booth, G Lueker - 1976
116 A linear algorithm for embedding planar graphs using PQ-trees,"JCSS 30 – N Chiba, T Nishizeki, S Abe, T Ozawa - 1985
381 Graph Minors II: Algorithmic Aspects of Treewidth – N Robertson, P Seymour - 1986
22 A Kuratowski theorem for nonorientable surfaces – D Archdeacon, P Huneke - 1989
41 Graph minors. VIII. A Kuratowski theorem for general surfaces – N Robertson, P D Seymour - 1990