|
273
|
Graph minors. ii. algorithmic aspects of tree-width
– Robertson, Seymour
- 1987
|
|
215
|
Algorithms for drawing graphs: an annotated bibliography. Available via anonymous ftp from wilma.cs.brown.edu in /pub/papers/compgeo/gdbiblio.ps.Z
– Battista, Eades, et al.
- 1994
|
|
169
|
Graph minors XIII. The disjoint paths problem
– Robertson, Seymour
- 1995
|
|
121
|
Graph minors X: Obstructions to tree-decomposition
– Robertson, Seymour
- 1991
|
|
120
|
Linear time algorithms for np-hard problems restricted to partial k-trees. Discrete and Applied Mathematics
– Arnborg, Proskourowski
|
|
95
|
A linear algorithm for embedding planar graphs using P Qtrees
– Chiba, Nishizeki, et al.
- 1985
|
|
83
|
Graph Minors I. Excluding a forest
– Robertson, Seymour
- 1983
|
|
59
|
Graphs minors --- a survey
– Robertson, Seymour
- 1985
|
|
48
|
Graph minors. XX. Wagner’s conjecture
– Robertson, Seymour
|
|
41
|
Graph Minors VII. Disjoint paths on a surface
– Robertson, Seymour
- 1988
|
|
39
|
Tree width and tangles: A new connectivity measure and some applications
– REED
- 1997
|
|
37
|
A Kuratowski theorem for the projective plane
– Archdeacon
|
|
36
|
Graph minors. IV. Tree-width and wellquasi -ordering
– Robertson, Seymour
- 1990
|
|
36
|
Graph minors. XVI. Excluding a non-planar graph
– Robertson, Seymour
- 1994
|
|
33
|
Graph Theory, Second Edition
– Diestel
- 2000
|
|
32
|
Excluding a planar graph
– unknown authors
- 1986
|
|
32
|
The graph genus problem is NP-complete
– Thomassen
- 1989
|
|
30
|
Graph minors
– Robertson, Seymour
|
|
30
|
Graph minors. VIII. A Kuratowski theorem for general surfaces
– Robertson, Seymour
- 1990
|
|
30
|
Circular chromatic number, a survey, Discrete Math., to appear
– Zhu
|
|
28
|
Tutte, A contribution to the theory of chromatic polynomials
– T
- 1954
|
|
27
|
Highly connected sets and the excluded grid theorem
– Diestel, Jensen, et al.
- 1999
|
|
27
|
Tarjan, E#cient planarity testing
– Hopcroft, E
- 1974
|
|
25
|
Depth-first search and Kuratowski subgraphs
– Williamson
- 1984
|
|
23
|
103 graphs that are irreducible for the projective plane
– Glover, Huneke, et al.
|
|
23
|
A linear time algorithm for embedding graphs in an arbitrary surface
– Mohar
- 1999
|
|
20
|
Graph Minors IX. Disjoint Crossed Paths
– Robertson, Seymour
- 1990
|
|
17
|
A Kuratowski theorem for nonorientable surfaces
– Archdeacon, Huneke
- 1989
|
|
16
|
Typical subgraphs of 3- and 4connected graphs
– Oporowski, Oxley, et al.
- 1993
|
|
16
|
A simpler proof of the excluded minor theorem for higher surfaces
– Thomassen
- 1997
|
|
11
|
On determining the genus of a graph
– Filotti, Miller, et al.
- 1979
|
|
10
|
Graph minors. XVII. Taming a vortex
– Robertson, Seymour
- 1999
|
|
9
|
Densely embedded graphs
– Archdeacon
- 1992
|
|
9
|
Projective planarity in linear time
– Mohar
- 1993
|
|
9
|
Uniqueness and minimality of large face-width embeddings of graph”, manuscript
– Mohar
- 1994
|
|
9
|
Embeddings and minors
– Thomassen
- 1995
|
|
8
|
Grid minors of graphs on the torus
– Graaf, Schrijver
- 1994
|
|
8
|
Graph minors. XII. Distance on a surface
– Robertson, Seymour
- 1995
|
|
7
|
Separating and nonseparating disjoint homotopic cycles in graph embeddings
– Brunet, Mohar, et al.
- 1996
|
|
6
|
Graph minors XVIII. Tree-decompositions and well-quasiordering
– Robertson, Seymour
- 1988
|
|
6
|
Graph minors. XIX. Well-quasi-ordering on a surface
– Robertson, Seymour
- 1989
|
|
5
|
Graph minors. XV. Giant steps
– Robertson, Seymour
- 1996
|
|
5
|
Graph minors. XXII. Irrelevant vertices in linkage problems, preprint
– Robertson, Seymour
- 1992
|
|
4
|
Generating locally cyclic triangulations of surfaces
– Malnic, Mohar
- 1992
|
|
4
|
Graph minors. XIV. Extending an embedding
– Robertson, Seymour
- 1995
|
|
4
|
Graph minors. XXI. Graphs with unique linkages, preprint
– Robertson, Seymour
- 1992
|
|
3
|
An outline of a disjoint paths algorithm, in: "Paths, Flows, and VLSI-Layout
– Robertson, Seymour
- 1990
|
|
3
|
Representativity of surface embeddings, in: "Paths, Flows, and VLSI-Layout
– Robertson, Vitray
- 1990
|
|
3
|
A bound on the excluded minors for a surface, submitted
– Seymour
|
|
3
|
Uniqueness of highly representative surface embeddings
– Seymour, Thomas
- 1996
|
