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

by Bojan Mohar
Citations:54 - 10 self

Documents Related by Co-Citation

11502 Computers and Intractability, A Guide to the Theory of NPCompleteness – M R Garey, D S Johnson - 1979
238 Efficient planarity testing – John Hopcroft, Robert, Tar Jan - 1974
59 The graph genus problem is NP-complete – C Thomassen - 1989
339 Topological Graph Theory – J L Gross, T W Tucker - 2001
213 Graphs on surfaces – BOJAN MOHAR, CARSTEN THOMASSEN - 2001
485 Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-tree Algorithms – K S Booth, G S Lueker - 1976
402 A Separator Theorem for Planar Graphs – Richard J. Lipton, Robert E. Tarjan - 1977
528 The complexity of computing the permanent – L G Valiant - 1979
907 Algebraic topology – Allen Hatcher