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

by Bojan Mohar
Citations:53 - 10 self

Documents Related by Co-Citation

59 The graph genus problem is NP-complete – C Thomassen - 1989
202 Graphs on Surfaces – B Mohar, C Thomassen - 2001
394 A Separator Theorem for Planar Graphs – Richard J. Lipton, Robert E. Tarjan - 1977
227 Efficient planarity testing – John Hopcroft, Robert, Tar Jan - 1974
312 Topological graph theory – J L Gross, T W Tucker - 2001
470 Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms – K Booth, G Lucker - 1976
810 Matrix multiplication via arithmetic progressions – Don Coppersmith, Shmuel Winograd - 1990
517 The complexity of computing the permanent – L Valiant - 1979
836 Algebraic Topology – A Hatcher - 2002