|
47
|
The graph genus problem is NP-complete
– C Thomassen
- 1989
|
|
239
|
Topological graph theory
– Jonathan L Gross, Thomas W Tucker
- 2001
|
|
161
|
Graphs on Surfaces
– Bojan Mohar, Carsten Thomassen
- 2001
|
|
193
|
Efficient planarity testing
– J Hopcroft, R E Tarjan
- 1974
|
|
9
|
Separating and nonseparating disjoint homotopic cycles in graph embeddings
– R Brunet, B Mohar, R B Richter
- 1996
|
|
12
|
Projective planarity in linear time
– B Mohar
- 1993
|
|
32
|
Finding shortest non-separating and non-contractible cycles for topologically embedded graphs
– Sergio Cabello, Bojan Mohar
- 2005
|
|
141
|
Sur le probleme des courbes gauches en topologie, Fund
– K Kuratowski
- 1930
|
|
29
|
Depth-first search and Kuratowski subgraphs
– S G Williamson
- 1984
|
|
20
|
A Kuratowski Theorem for Nonorientable Surfaces
– D Archdeacon, J P Huneke
- 1989
|
|
6
|
Planar crossing numbers of graphs embeddable in another
– Károly J. Böröczky, János Pach, Géza Tóth
- 2006
|
|
5
|
Planar crossing numbers of genus g graphs
– Hristo Djidjev, Imrich Vrtó
- 2006
|
|
10
|
Planar decompositions and the crossing number of graphs with an excluded minor
– David R. Wood, Jan Arne Telle
- 2007
|
|
69
|
Time-bounded random access machines
– Stephen A Cook, Robert A Reckhow
- 1972
|
|
20
|
A depth-first-search characterization of planarity
– H de Fraysseix, P Rosenstiehl
- 1982
|
|
16
|
Embedding graphs in the plane- algorithmic aspects
– S G Williamson
- 1980
|
|
406
|
Testing for the consecutive ones properties, interval graphs and graph planarity using PQ-tree algorithm
– K S Booth, G S Lueker
- 1976
|
|
102
|
A linear algorithm for embedding planar graphs using PQ-trees
– N Chiba, T Nishizeki, S Abe, T Ozawa
- 1985
|
|
338
|
A Separator Theorem for Planar Graphs f
– Richard J. Lipton, Robert E. Tarjan
- 1977
|
