Item Successfully Added to Cart
An error was encountered while trying to add the item to the cart. Please try again.
OK
Please make all selections above before adding to cart
OK
Share this page via the icons above, or by copying the link below:
Copy To Clipboard
Successfully Copied!
Graph Structure Theory
 
Edited by: Neil Robertson
Paul Seymour
Graph Structure Theory
Softcover ISBN:  978-0-8218-5160-9
Product Code:  CONM/147
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-7738-8
Product Code:  CONM/147.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-5160-9
eBook: ISBN:  978-0-8218-7738-8
Product Code:  CONM/147.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
Add to cart
Graph Structure Theory
Click above image for expanded view
Graph Structure Theory
Edited by: Neil Robertson
Paul Seymour
Softcover ISBN:  978-0-8218-5160-9
Product Code:  CONM/147
List Price: $130.00
MAA Member Price: $117.00
AMS Member Price: $104.00
eBook ISBN:  978-0-8218-7738-8
Product Code:  CONM/147.E
List Price: $125.00
MAA Member Price: $112.50
AMS Member Price: $100.00
Softcover ISBN:  978-0-8218-5160-9
eBook ISBN:  978-0-8218-7738-8
Product Code:  CONM/147.B
List Price: $255.00 $192.50
MAA Member Price: $229.50 $173.25
AMS Member Price: $204.00 $154.00
Add to cart
  • Book Details
     
     
    Contemporary Mathematics
    Volume: 147; 1993; 688 pp
    MSC: Primary 05; Secondary 68; 06; 57

    This volume contains the proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, held at the University of Washington in Seattle in the summer of 1991. Among the topics covered are: algorithms on tree-structured graphs, well-quasi-ordering, logic, infinite graphs, disjoint path problems, surface embeddings, knot theory, graph polynomials, matroid theory, and combinatorial optimization.
    Readership

    Research mathematicians.
  • Table of Contents
     
     
    • Articles
    • W. T. Tutte — Polynomials [ MR 1224694 ]
    • James Oxley and Geoff Whittle — Tutte invariants for $2$-polymatroids [ MR 1224695 ]
    • Joseph P. S. Kung — Extremal matroid theory [ MR 1224696 ]
    • Teresa M. Przytycka and Józef H. Przytycki — Subexponentially computable truncations of Jones-type polynomials [ MR 1224697 ]
    • D. J. A. Welsh — Knots and braids: some algorithmic questions [ MR 1224698 ]
    • Neil Robertson, P. D. Seymour and Robin Thomas — A survey of linkless embeddings [ MR 1224699 ]
    • Edited by Neil Robertson and Paul Seymour — Colin de Verdière – On a new graph invariant and a criterion for planarity (This article is not available due to permission restrictions.) [ MR 1224693 ]
    • Oleg Borodin — Four problems on plane graphs raised by Branko Grünbaum [ MR 1224701 ]
    • Bruce Reed — Counterexamples to a conjecture of Las Vergnas and Meyniel [ MR 1224702 ]
    • Béla Bollobás, Bruce Reed and Andrew Thomason — An extremal function for the achromatic number [ MR 1224703 ]
    • H. J. Prömel and A. Steger — The asymptotic structure of $H$-free graphs [ MR 1224704 ]
    • Michael Fellows, Jan Kratochvíl, Matthias Middendorf and Frank Pfeiffer — Induced minors and related problems [ MR 1224705 ]
    • Alexander Schrijver — Induced circuits in graphs on surfaces [ MR 1224706 ]
    • András Frank and Tibor Jordán — Tree-representation of directed circuits [ MR 1224707 ]
    • William McCuaig — Intercyclic digraphs [ MR 1224708 ]
    • Jørgen Bang-Jensen and Svatopluk Poljak — Eulerian trails through a set of terminals in specific, unique and all orders [ MR 1224709 ]
    • Haruko Okamura — $2$-reducible cycles containing two specified edges in $(2k+1)$-edge-connected graphs [ MR 1224710 ]
    • Andreas Huck — Edge-disjoint cycles in $n$-edge-connected graphs [ MR 1224711 ]
    • B. A. Reed, N. Robertson, A. Schrijver and P. D. Seymour — Finding disjoint trees in planar graphs in linear time [ MR 1224712 ]
    • Teresa M. Przytycka and Józef H. Przytycki — Surface triangulations without short noncontractible cycles [ MR 1224713 ]
    • R. P. Vitray — Representativity and flexibility on the projective plane [ MR 1224714 ]
    • Xiao Ya Zha and Yue Zhao — On nonnull separating circuits in embedded graphs [ MR 1224715 ]
    • Seiya Negami — Projective-planar graphs with even duals. II [ MR 1224716 ]
    • Nathaniel Dean and Katsuhiro Ota — $2$-factors, connectivity and graph minors [ MR 1224717 ]
    • John Philip Huneke — A conjecture in topological graph theory [ MR 1224718 ]
    • Xiao Ya Zha — On the closed $2$-cell embedding conjecture [ MR 1224719 ]
    • Cun-Quan Zhang — Cycle cover theorems and their applications
    • Luis A. Goddyn — Cones, lattices and Hilbert bases of circuits and perfect matchings [ MR 1224721 ]
    • Pavol Gvozdjak and Jozef Širáň — Regular maps from voltage assignments [ MR 1224722 ]
    • Bogdan Oporowski — The infinite grid covers the infinite half-grid [ MR 1224723 ]
    • Reinhard Diestel — Dominating functions and topological graph minors [ MR 1224724 ]
    • H. A. Jung — Notes on rays and automorphisms of locally finite graphs [ MR 1224725 ]
    • L. Gordeev — Quasi-ordinals and proof theory [ MR 1224726 ]
    • Dirk Vertigan — Minor classes: extended abstract [ MR 1224727 ]
    • Jens Gustedt — Well-quasi-ordering finite posets (extended abstract) [ MR 1224728 ]
    • Guoli Ding — The immersion relation on webs [ MR 1224729 ]
    • Neil Robertson, P. D. Seymour and Robin Thomas — Structural descriptions of lower ideals of trees [ MR 1224730 ]
    • Karl Abrahamson and Michael Fellows — Finite automata, bounded treewidth and well-quasiordering [ MR 1224731 ]
    • Bruno Courcelle — Graph grammars, monadic second-order logic and the theory of graph minors [ MR 1224732 ]
    • Andrzej Proskurowski — Graph reductions, and techniques for finding minimal forbidden minors [ MR 1224733 ]
    • Jens Lagergren — An upper bound on the size of an obstruction [ MR 1224734 ]
    • Michael A. Langston — An obstruction-based approach to layout optimization [ MR 1224735 ]
    • Collette R. Coullard and Donald K. Wagner — Decomposing $3$-connected graphs [ MR 1224736 ]
    • A. K. Kelmans — Graph planarity and related topics [ MR 1224737 ]
    • Neil Robertson and Paul Seymour — Excluding a graph with one crossing [ MR 1224738 ]
    • Nathaniel Dean — Open Problems
  • Requests
     
     
    Review Copy – for publishers of book reviews
    Permission – for use of book, eBook, or Journal content
    Accessibility – to request an alternate format of an AMS title
Contemporary Mathematics
Volume: 147; 1993; 688 pp
MSC: Primary 05; Secondary 68; 06; 57

This volume contains the proceedings of the AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors, held at the University of Washington in Seattle in the summer of 1991. Among the topics covered are: algorithms on tree-structured graphs, well-quasi-ordering, logic, infinite graphs, disjoint path problems, surface embeddings, knot theory, graph polynomials, matroid theory, and combinatorial optimization.
Readership

Research mathematicians.
  • Articles
  • W. T. Tutte — Polynomials [ MR 1224694 ]
  • James Oxley and Geoff Whittle — Tutte invariants for $2$-polymatroids [ MR 1224695 ]
  • Joseph P. S. Kung — Extremal matroid theory [ MR 1224696 ]
  • Teresa M. Przytycka and Józef H. Przytycki — Subexponentially computable truncations of Jones-type polynomials [ MR 1224697 ]
  • D. J. A. Welsh — Knots and braids: some algorithmic questions [ MR 1224698 ]
  • Neil Robertson, P. D. Seymour and Robin Thomas — A survey of linkless embeddings [ MR 1224699 ]
  • Edited by Neil Robertson and Paul Seymour — Colin de Verdière – On a new graph invariant and a criterion for planarity (This article is not available due to permission restrictions.) [ MR 1224693 ]
  • Oleg Borodin — Four problems on plane graphs raised by Branko Grünbaum [ MR 1224701 ]
  • Bruce Reed — Counterexamples to a conjecture of Las Vergnas and Meyniel [ MR 1224702 ]
  • Béla Bollobás, Bruce Reed and Andrew Thomason — An extremal function for the achromatic number [ MR 1224703 ]
  • H. J. Prömel and A. Steger — The asymptotic structure of $H$-free graphs [ MR 1224704 ]
  • Michael Fellows, Jan Kratochvíl, Matthias Middendorf and Frank Pfeiffer — Induced minors and related problems [ MR 1224705 ]
  • Alexander Schrijver — Induced circuits in graphs on surfaces [ MR 1224706 ]
  • András Frank and Tibor Jordán — Tree-representation of directed circuits [ MR 1224707 ]
  • William McCuaig — Intercyclic digraphs [ MR 1224708 ]
  • Jørgen Bang-Jensen and Svatopluk Poljak — Eulerian trails through a set of terminals in specific, unique and all orders [ MR 1224709 ]
  • Haruko Okamura — $2$-reducible cycles containing two specified edges in $(2k+1)$-edge-connected graphs [ MR 1224710 ]
  • Andreas Huck — Edge-disjoint cycles in $n$-edge-connected graphs [ MR 1224711 ]
  • B. A. Reed, N. Robertson, A. Schrijver and P. D. Seymour — Finding disjoint trees in planar graphs in linear time [ MR 1224712 ]
  • Teresa M. Przytycka and Józef H. Przytycki — Surface triangulations without short noncontractible cycles [ MR 1224713 ]
  • R. P. Vitray — Representativity and flexibility on the projective plane [ MR 1224714 ]
  • Xiao Ya Zha and Yue Zhao — On nonnull separating circuits in embedded graphs [ MR 1224715 ]
  • Seiya Negami — Projective-planar graphs with even duals. II [ MR 1224716 ]
  • Nathaniel Dean and Katsuhiro Ota — $2$-factors, connectivity and graph minors [ MR 1224717 ]
  • John Philip Huneke — A conjecture in topological graph theory [ MR 1224718 ]
  • Xiao Ya Zha — On the closed $2$-cell embedding conjecture [ MR 1224719 ]
  • Cun-Quan Zhang — Cycle cover theorems and their applications
  • Luis A. Goddyn — Cones, lattices and Hilbert bases of circuits and perfect matchings [ MR 1224721 ]
  • Pavol Gvozdjak and Jozef Širáň — Regular maps from voltage assignments [ MR 1224722 ]
  • Bogdan Oporowski — The infinite grid covers the infinite half-grid [ MR 1224723 ]
  • Reinhard Diestel — Dominating functions and topological graph minors [ MR 1224724 ]
  • H. A. Jung — Notes on rays and automorphisms of locally finite graphs [ MR 1224725 ]
  • L. Gordeev — Quasi-ordinals and proof theory [ MR 1224726 ]
  • Dirk Vertigan — Minor classes: extended abstract [ MR 1224727 ]
  • Jens Gustedt — Well-quasi-ordering finite posets (extended abstract) [ MR 1224728 ]
  • Guoli Ding — The immersion relation on webs [ MR 1224729 ]
  • Neil Robertson, P. D. Seymour and Robin Thomas — Structural descriptions of lower ideals of trees [ MR 1224730 ]
  • Karl Abrahamson and Michael Fellows — Finite automata, bounded treewidth and well-quasiordering [ MR 1224731 ]
  • Bruno Courcelle — Graph grammars, monadic second-order logic and the theory of graph minors [ MR 1224732 ]
  • Andrzej Proskurowski — Graph reductions, and techniques for finding minimal forbidden minors [ MR 1224733 ]
  • Jens Lagergren — An upper bound on the size of an obstruction [ MR 1224734 ]
  • Michael A. Langston — An obstruction-based approach to layout optimization [ MR 1224735 ]
  • Collette R. Coullard and Donald K. Wagner — Decomposing $3$-connected graphs [ MR 1224736 ]
  • A. K. Kelmans — Graph planarity and related topics [ MR 1224737 ]
  • Neil Robertson and Paul Seymour — Excluding a graph with one crossing [ MR 1224738 ]
  • Nathaniel Dean — Open Problems
Review Copy – for publishers of book reviews
Permission – for use of book, eBook, or Journal content
Accessibility – to request an alternate format of an AMS title
Powered by MathJax
Please select which format for which you are requesting permissions.