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