|
186
|
Crossing number is np-complete
– M R Garey, D S Johnson
- 1983
|
|
29
|
On the deletion of nonplanar edges of a graph
– P C Liu, R C Geldmacher
- 1977
|
|
194
|
Efficient planarity testing
– J Hopcroft, R Tarjan
- 1974
|
|
141
|
Sur le probleme des courbes gauches en topologie, Fund
– K Kuratowski
- 1930
|
|
26
|
A Better Approximation Algorithm for Finding Planar Subgraphs
– Gruia Calinescu , Cristina G. Fernandes, Ulrich Finkler, Howard Karloff
- 1996
|
|
88
|
Complexity Issues in VLSI
– F T Leighton
- 1983
|
|
30
|
Maximum Planar Subgraphs and Nice Embeddings: Practical Layout Tools
– Michael Jünger, Petra Mutzel
- 1996
|
|
283
|
Graph Drawing – Algorithms for the Visualization of Graphs
– G Di Battista, P Eades, R Tamassia, I G Tollis
- 1999
|
|
23
|
Stop Minding Your P's and Q's: A Simplified O(n) Planar Embedding Algorithm
– John Boyer, Wendy Myrvold
- 1999
|
|
30
|
Edge-deletion problems
– M Yannakakis
- 1981
|
|
4
|
The splitting number of the complete graph
– N Hartfield, B Jackson, G Ringel
- 1985
|
|
4
|
The splitting number of complete bipartite graphs
– B Jackson, G Ringel
- 1984
|
|
5
|
Heuristics for planarization by vertex splitting
– P Eades, C F X de Mendonca
- 1993
|
|
8
|
An algorithm for finding large induced planar subgraphs
– K Edwards, G Farr
- 2001
|
|
22
|
Determining the thickness of a graph is NP-hard
– A Mansfield
- 1983
|
|
61
|
Node-and edge-deletion NP-complete problems
– M Yannakakis
- 1978
|
|
40
|
Generating Random Regular Graphs Quickly
– A. Steger, N.C. Wormald
- 1999
|
|
17
|
On VLSI Layouts Of The Star Graph And Related Networks
– Ondrej Sykora, Imrich Vrtó
- 1994
|
|
17
|
The thickness of the complete graph
– L W Beineke, Frank Harary
- 1965
|
