Cargando…

Graph structure theory : proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, held June 22 to July 5, 1991, with support from the National Science Foundation and the Office of Naval Research /

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores Corporativos: AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors University of Washington, National Science Foundation (U.S.), United States. Office of Naval Research
Otros Autores: Robertson, Neil, 1938-, Seymour, Paul D.
Formato: Electrónico Congresos, conferencias eBook
Idioma:Inglés
Publicado: Providence, R.I. : American Mathematical Society, ©1993.
Colección:Contemporary mathematics (American Mathematical Society) ; v. 147.
Temas:
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Polynomials / W. T. Tutte
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01162 Tutte invariants for $2$-polymatroids / James Oxley and Geoff Whittle
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01163 Extremal matroid theory / Joseph P. S. Kung
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01164 Subexponentially computable truncations of Jones-type polynomials / Teresa M. Przytycka and Józef H. Przytycki
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01165 Knots and braids: some algorithmic questions / D. J. A. Welsh
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01166 A survey of linkless embeddings / Neil Robertson, P. D. Seymour and Robin Thomas
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01167 Colin de Verdière
  • On a new graph invariant and a criterion for planarity (This article is not available due to permission restrictions.) http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147 Four problems on plane graphs raised by Branko Grünbaum / Oleg Borodin
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01169 Counterexamples to a conjecture of Las Vergnas and Meyniel / Bruce Reed
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01170 An extremal function for the achromatic number / Béla Bollobás, Bruce Reed and Andrew Thomason
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01171 The asymptotic structure of $H$-free graphs / H. J. Prömel and A. Steger
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01172 Induced minors and related problems / Michael Fellows, Jan Kratochvíl, Matthias Middendorf and Frank Pfeiffer
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01173 Induced circuits in graphs on surfaces / Alexander Schrijver
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01174 Tree-representation of directed circuits / András Frank and Tibor Jordán
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01175 Intercyclic digraphs / William McCuaig
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01176 Eulerian trails through a set of terminals in specific, unique and all orders / Jørgen Bang-Jensen and Svatopluk Poljak
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01177 $2$-reducible cycles containing two specified edges in $(2k+1)$-edge-connected graphs / Haruko Okamura
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01178 Edge-disjoint cycles in $n$-edge-connected graphs / Andreas Huck
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01179 Finding disjoint trees in planar graphs in linear time / B. A. Reed, N. Robertson, A. Schrijver and P. D. Seymour
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01180 Surface triangulations without short noncontractible cycles / Teresa M. Przytycka and Józef H. Przytycki
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01181 Representativity and flexibility on the projective plane / R. P. Vitray
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01182 On nonnull separating circuits in embedded graphs / Xiao Ya Zha and Yue Zhao
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01183 Projective-planar graphs with even duals. II / Seiya Negami
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01184 $2$-factors, connectivity and graph minors / Nathaniel Dean and Katsuhiro Ota
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01185 A conjecture in topological graph theory / John Philip Huneke
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01186 On the closed $2$-cell embedding conjecture / Xiao Ya Zha
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01187 Cycle cover theorems and their applications / Cun-Quan Zhang
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/1188 Cones, lattices and Hilbert bases of circuits and perfect matchings / Luis A. Goddyn
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01189 Regular maps from voltage assignments / Pavol Gvozdjak and Jozef Širáň
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01190 The infinite grid covers the infinite half-grid / Bogdan Oporowski
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01191 Dominating functions and topological graph minors / Reinhard Diestel
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01192 Notes on rays and automorphisms of locally finite graphs / H. A. Jung
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01193 Quasi-ordinals and proof theory / L. Gordeev
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01194 Minor classes: extended abstract / Dirk Vertigan
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01195 Well-quasi-ordering finite posets (extended abstract) / Jens Gustedt
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01196 The immersion relation on webs / Guoli Ding
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01197 Structural descriptions of lower ideals of trees / Neil Robertson, P. D. Seymour and Robin Thomas
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01198 Finite automata, bounded treewidth and well-quasiordering / Karl Abrahamson and Michael Fellows
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01199 Graph grammars, monadic second-order logic and the theory of graph minors / Bruno Courcelle
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01200 Graph reductions, and techniques for finding minimal forbidden minors / Andrzej Proskurowski
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01201 An upper bound on the size of an obstruction / Jens Lagergren
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01202 An obstruction-based approach to layout optimization / Michael A. Langston
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01203 Decomposing $3$-connected graphs / Collette R. Coullard and Donald K. Wagner
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01204 Graph planarity and related topics / A. K. Kelmans
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01205 Excluding a graph with one crossing / Neil Robertson and Paul Seymour
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/01206 Open Problems / Nathaniel Dean
  • http://www.ams.org/conm/147/ http://dx.doi.org/10.1090/conm/147/45