LEADER 04378nam 2200613 450 001 9910812579703321 005 20180731044351.0 010 $a0-8218-7738-0 035 $a(CKB)3240000000069676 035 $a(EBL)3112963 035 $a(SSID)ssj0000629325 035 $a(PQKBManifestationID)11388859 035 $a(PQKBTitleCode)TC0000629325 035 $a(PQKBWorkID)10731161 035 $a(PQKB)10652947 035 $a(MiAaPQ)EBC3112963 035 $a(RPAM)4414747 035 $a(PPN)197104738 035 $a(EXLCZ)993240000000069676 100 $a19930211h19931993 uy| 0 101 0 $aeng 135 $aur|n|---||||| 181 $ctxt 182 $cc 183 $acr 200 10$aGraph structure theory $eproceedings 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 /$fNeil Robertson, Paul Seymour, editors 210 1$aProvidence, Rhode Island :$cAmerican Mathematical Society,$d[1993] 210 4$dİ1993 215 $a1 online resource (706 p.) 225 1 $aContemporary mathematics,$x0271-4132 ;$v147 300 $aDescription based upon print version of record. 311 $a0-8218-5160-8 320 $aIncludes bibliographical references. 327 $a""Induced minors and related problems""""Induced circuits in graphs on surfaces""; ""Tree-representation of directed circuits""; ""Intercyclic digraphs""; ""Eulerian trails through a set of terminals in specific, unique and all orders""; ""2-reducible cycles containing two specified edges in (2k+1 )-edge-connected graphs""; ""Edge-disjoint cycles in n-edge-connected graphs""; ""Finding disjoint trees in planar graphs in linear time""; ""Surface triangulations without short noncontractible cycles""; ""Representativity and flexibility on the projective plane"" 327 $a""On non-null separating circuits in embedded graphs""""Projective-planar graphs with even duals II""; ""2-factors, connectivity, and graph minors""; ""A conjecture in topological graph theory""; ""On the closed 2-cell embedding conjecture""; ""Cycle cover theorems and their applications""; ""Cones, lattices and Hilbert bases of circuits and perfect matchings""; ""Regular maps from voltage assignments""; ""The infinite grid covers the infinite half-grid""; ""Dominating functions and topological graph minors""; ""Notes on rays and automorphisms of locally finite graphs"" 327 $a""Quasi-ordinals and proof theory""""Minor classes: Extended abstract""; ""Well-quasi -ordering finite posets""; ""The immersion relation on webs""; ""Structural descriptions of lower ideals of trees""; ""Finite automata, bounded treewidth, and well-quasiordering""; ""Graph grammars, monadic second-order logic and the theory of graph minors""; ""Graph reductions, and techniques for finding minimal forbidden minors""; ""An upper bound on the size of an obstruction""; ""An obstruction-based approach to layout optimization""; ""Decomposing 3-connected graphs"" 327 $a""Graph planarity and related topics""""1. Introduction""; ""2. The main concepts and notation""; ""3. Some classical results""; ""4. Simple reductions of the graph planarity problem""; ""5. Subdivisions of K5 , K3,3, and L in a graph""; ""6. Subdivisions of K3,3 in a 3-connected graph with some edges not subdivided""; ""7. A vertex in a matroid and the corresponding notion and dual notion for graphs""; ""8. More about non-separating circuits in a graph""; ""9. Triangle and 3-cut reductions of the graph planarity problem""; ""10. Subdivisions of K, M, and N in quasi 4-connected graphs"" 327 $a""11. An ear-like decomposition for quasi 4-connected graphs"" 410 0$aContemporary mathematics (American Mathematical Society) ;$v147. 606 $aGraph theory$vCongresses 615 0$aGraph theory 676 $a511/.5 702 $aRobertson$b Neil$f1938- 702 $aSeymour$b Paul D. 712 02$aNational Science Foundation (U.S.), 712 02$aUnited States.$bOffice of Naval Research, 712 12$aAMS-IMS-SIAM Joint Summer Research Conference on Graph Minors 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910812579703321 996 $aGraph structure theory$93938357 997 $aUNINA