Neil Robertson, Paul D. Seymour (Eds.):
Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors held June 22 to July 5, 1991, at the University of Washington, Seattle.
Contemporary Mathematics 147 American Mathematical Society 1993, ISBN 0-8218-5160-8 
@proceedings{DBLP:conf/gst/1991,
editor = {Neil Robertson and
Paul D. Seymour},
title = {Graph Structure Theory, Proceedings of a AMS-IMS-SIAM Joint Summer
Research Conference on Graph Minors held June 22 to July 5, 1991,
at the University of Washington, Seattle},
booktitle = {Graph Structure Theory},
publisher = {American Mathematical Society},
series = {Contemporary Mathematics},
volume = {147},
year = {1993},
isbn = {0-8218-5160-8},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
- W. T. Tuttle:
Polynomials.
1-8
- James G. Oxley, Geoff Whittle:
Tuttle invariants for 2-polymatroids.
9-20
- Joseph P. S. Kung:
Extremmal matroid theory.
21-62
- Teresa M. Przytycka, Józef H. Przytycki:
Subexponentially computable truncations of Jones-types polynomials.
63-108
- Dominic Welsh:
Knots and braids: Some algorithmic questions.
109-124
- Neil Robertson, Paul D. Seymour, Robin Thomas:
A survey of linkless embeddings.
125-136
- Yves Colin de Verdière:
On a new graph invariant and a criterion for planarity.
137-148
- Oleg V. Borodin:
Four problems on plane graphs raised by Branko Grünbaum.
149-156
- Bruce A. Reed:
Counterexamples to a conjecture of Las Vergnas and Meyniel.
157-160
- Béla Bollobás, Bruce A. Reed, Andrew Thomason:
An extremal function for the achromatic number.
161-166
- Hans Jürgen Prömel, Angelika Steger:
The asymptotic structure of H-free graphs.
167-178
- Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer:
Induced minors and related problems.
179-182
- Alexander Schrijver:
Induced circuits in graphs on surfaces.
183-194
- András Frank, Tibor Jordán:
Tree-representation of directed circuits.
195-202
- William McCuaig:
Intercyclic digraphs.
203-246
- Jørgen Bang-Jensen, Svatopluk Poljak:
Eulerian trails through a set of terminals in specific, unique and all orders.
247-258
- Haruko Okamura:
2-reducible cycles containing two specified edges in (2k+1)-edge-connected graphs.
259-278
- Andreas Huck:
Edge-disjoint cycles in n-edge-connected graphs.
279-294
- Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour:
Finding dsjoint trees in planar graphs in linear time.
295-302
- Teresa M. Przytycka, Józef H. Przytycki:
Surface triangulations without short noncontractible cycles.
303-340
- Richard P. Vitray:
Representativity and flexibility on the projective plane.
341-348
- Xiaoya Zha, Yue Zhao:
On non-null separating circuits in embedded graphs.
349-362
- Seiya Negami:
Projective-planar graphs with even duals II.
363-380
- Nathaniel Dean, Katsuhiro Ota:
2-factors, connectivity, and graph minors.
381-386
- John Philip Huneke:
A conjecture in topological graph theory.
387-390
- Xiaoya Zha:
On the closed 2-cell embedding conjecture.
391-404
- Cun-Quan Zhang:
Cycle cover theorems and their applications.
405-418
- Luis A. Goddyn:
Cones, lattices and Hilbert bases of circuits and perfect matchings.
419-440
- Pavol Gvozdjak, Jozef Sirán:
Regular maps from voltage assignments.
441-454
- Bogdan Oporowski:
The infinite grid covers the infinite half-grid.
455-460
- Reinhard Diestel:
Dominating functions and topological graph minors.
461-476
- Heinz Adolf Jung:
Notes on rays and automorphisms of locally finite graphs.
477-484
- Lew Gordeev:
Quasi-ordinals and proof theory.
485-494
- Dirk Vertigan:
Minor classes (extended abstract).
495-510
- Jens Gustedt:
Well-quasi-ordering finite posets.
511-516
- Guoli Ding:
The immersion relation on webs.
517-524
- Neil Robertson, Paul D. Seymour, Robin Thomas:
Structural descriptions of lower ideals of trees.
525-538
- Karl R. Abrahamson, Michael R. Fellows:
Finite automata, bounded treewidth, and well-quasiordering.
539-564
- Bruno Courcelle:
Graph grammars, monadic second-order logic and the theory of graph minors.
565-590
- Andrzej Proskurowski:
Graph reductions, and techniques for finding minimal forbidden minors.
591-600
- Jens Lagergren:
An upper bound on the size of an obstruction.
601-622
- Michael A. Langston:
An obstruction-based approach to layout optimization.
623-630
- Collette R. Coullard, Donald K. Wagner:
Decomposing 3-connected graphs.
631-634
- Alexander K. Kelmans:
Graph planarity and related topics.
635-668
- Neil Robertson, Paul D. Seymour:
Excluding a graph with one crossing.
669-676
- Nathaniel Dean:
Open problems.
677-
Last update Fri May 25 08:15:17 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
