default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGraph Structure Theory 1991: Seattle, Washington, USA
- Neil Robertson, Paul D. Seymour:
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, USA. Contemporary Mathematics 147, American Mathematical Society 1993, ISBN 0-8218-5160-8 - W. T. Tuttle:
Polynomials. 1-8 - James G. Oxley, Geoff Whittle:
Tuttle invariants for 2-polymatroids. 9-19 - Joseph P. S. Kung:
Extremal matroid theory. 21-61 - 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-123 - 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. Graph Structure Theory 1991: 137-147 - Oleg V. Borodin:
Four problems on plane graphs raised by Branko Grünbaum. Graph Structure Theory 1991: 149-156 - Bruce A. Reed:
Counterexamples to a conjecture of Las Vergnas and Meyniel. Graph Structure Theory 1991: 157-159 - Béla Bollobás, Bruce A. Reed, Andrew Thomason:
An extremal function for the achromatic number. Graph Structure Theory 1991: 161-165 - Hans Jürgen Prömel, Angelika Steger:
The asymptotic structure of H-free graphs. Graph Structure Theory 1991: 167-178 - Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer:
Induced minors and related problems. Graph Structure Theory 1991: 179-182 - Alexander Schrijver:
Induced circuits in graphs on surfaces. Graph Structure Theory 1991: 183-193 - András Frank, Tibor Jordán:
Tree-representation of directed circuits. Graph Structure Theory 1991: 195-202 - William McCuaig:
Intercyclic digraphs. Graph Structure Theory 1991: 203-245 - Jørgen Bang-Jensen, Svatopluk Poljak:
Eulerian trails through a set of terminals in specific, unique and all orders. Graph Structure Theory 1991: 247-258 - Haruko Okamura:
2-reducible cycles containing two specified edges in (2k+1)-edge-connected graphs. Graph Structure Theory 1991: 259-277 - Andreas Huck:
Edge-disjoint cycles in n-edge-connected graphs. Graph Structure Theory 1991: 279-293 - Bruce A. Reed, Neil Robertson, Alexander Schrijver, Paul D. Seymour:
Finding disjoint trees in planar graphs in linear time. Graph Structure Theory 1991: 295-301 - Teresa M. Przytycka, Józef H. Przytycki:
Surface triangulations without short noncontractible cycles. Graph Structure Theory 1991: 303-340 - Richard P. Vitray:
Representativity and flexibility on the projective plane. Graph Structure Theory 1991: 341-347 - Xiaoya Zha, Yue Zhao:
On non-null separating circuits in embedded graphs. Graph Structure Theory 1991: 349-362 - Seiya Negami:
Projective-planar graphs with even duals II. Graph Structure Theory 1991: 363-379 - Nathaniel Dean, Katsuhiro Ota:
2-factors, connectivity, and graph minors. Graph Structure Theory 1991: 381-386 - John Philip Huneke:
A conjecture in topological graph theory. Graph Structure Theory 1991: 387-389 - Xiaoya Zha:
On the closed 2-cell embedding conjecture. Graph Structure Theory 1991: 391-404 - Cun-Quan Zhang:
Cycle cover theorems and their applications. Graph Structure Theory 1991: 405-417 - Luis A. Goddyn:
Cones, lattices and Hilbert bases of circuits and perfect matchings. Graph Structure Theory 1991: 419-439 - Pavol Gvozdjak, Jozef Sirán:
Regular maps from voltage assignments. Graph Structure Theory 1991: 441-454 - Bogdan Oporowski:
The infinite grid covers the infinite half-grid. Graph Structure Theory 1991: 455-460 - Reinhard Diestel:
Dominating functions and topological graph minors. Graph Structure Theory 1991: 461-476 - Heinz Adolf Jung:
Notes on rays and automorphisms of locally finite graphs. Graph Structure Theory 1991: 477-484 - Lew Gordeev:
Quasi-ordinals and proof theory. Graph Structure Theory 1991: 485-494 - Dirk Vertigan:
Minor classes (extended abstract). Graph Structure Theory 1991: 495-509 - Jens Gustedt:
Well-quasi-ordering finite posets. Graph Structure Theory 1991: 511-515 - Guoli Ding:
The immersion relation on webs. Graph Structure Theory 1991: 517-524 - Neil Robertson, Paul D. Seymour, Robin Thomas:
Structural descriptions of lower ideals of trees. Graph Structure Theory 1991: 525-538 - Karl R. Abrahamson, Michael R. Fellows:
Finite automata, bounded treewidth, and well-quasiordering. Graph Structure Theory 1991: 539-563 - Bruno Courcelle:
Graph grammars, monadic second-order logic and the theory of graph minors. Graph Structure Theory 1991: 565-590 - Andrzej Proskurowski:
Graph reductions, and techniques for finding minimal forbidden minors. Graph Structure Theory 1991: 591-600 - Jens Lagergren:
An upper bound on the size of an obstruction. Graph Structure Theory 1991: 601-621 - Michael A. Langston:
An obstruction-based approach to layout optimization. Graph Structure Theory 1991: 623-629 - Collette R. Coullard, Donald K. Wagner:
Decomposing 3-connected graphs. Graph Structure Theory 1991: 631-633 - Alexander K. Kelmans:
Graph planarity and related topics. Graph Structure Theory 1991: 635-667 - Neil Robertson, Paul D. Seymour:
Excluding a graph with one crossing. Graph Structure Theory 1991: 669-675 - Nathaniel Dean:
Open problems. Graph Structure Theory 1991: 677-688
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-06-19 00:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
