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:
Graph theory > Congresses.
Théorie des graphes > Congrès.
Graph theory
Graphes, théorie des > Congrès.
Conference papers and proceedings
Acceso en línea:Texto completo

MARC

LEADER 00000cam a2200000Ma 4500
001 EBOOKCENTRAL_ocn774694760
003 OCoLC
005 20240329122006.0
006 m o d
007 cr c||---|||||
008 930211s1993 riua ob 100 0 eng d
010 |z  93018553  
040 |a COO  |b eng  |e pn  |c COO  |d OTZ  |d OCLCF  |d YDXCP  |d E7B  |d OCLCO  |d UIU  |d OCLCA  |d OCL  |d OCLCO  |d EBLCP  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCQ  |d YOU  |d OCLCQ  |d LIP  |d OCLCQ  |d LEAUB  |d INARC  |d REDDC  |d VT2  |d K6U  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
015 |a GB9513049  |2 bnb 
019 |a 922980334  |a 1077892277  |a 1086459047  |a 1120892014  |a 1200471657  |a 1241833137  |a 1258905673  |a 1258949051  |a 1259179984  |a 1262670440  |a 1290101551  |a 1296540542  |a 1316175619  |a 1328541654 
020 |a 9780821877388  |q (online) 
020 |a 0821877380  |q (online) 
020 |a 9780821854815  |q (google) 
020 |a 082185481X  |q (google) 
020 |z 0821851608  |q (acid-free paper) 
020 |z 9780821851609  |q (acid-free paper) 
035 |a (OCoLC)774694760  |z (OCoLC)922980334  |z (OCoLC)1077892277  |z (OCoLC)1086459047  |z (OCoLC)1120892014  |z (OCoLC)1200471657  |z (OCoLC)1241833137  |z (OCoLC)1258905673  |z (OCoLC)1258949051  |z (OCoLC)1259179984  |z (OCoLC)1262670440  |z (OCoLC)1290101551  |z (OCoLC)1296540542  |z (OCoLC)1316175619  |z (OCoLC)1328541654 
050 4 |a QA166  |b .A48 1991 
082 0 4 |a 511/.5  |2 20 
084 |a 31.12  |2 bcl 
084 |a *00B25  |2 msc 
084 |a 05-06  |2 msc 
049 |a UAMI 
111 2 |a AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors  |d (1991 :  |c University of Washington) 
245 1 0 |a Graph structure theory :  |b 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 /  |c Neil Robertson, Paul Seymour, editors. 
260 |a Providence, R.I. :  |b American Mathematical Society,  |c ©1993. 
300 |a 1 online resource (xiv, 688 pages) :  |b illustrations 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a Contemporary mathematics ;  |v 147 
504 |a Includes bibliographical references. 
505 0 0 |t Polynomials /  |r W. T. Tutte --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01162  |t Tutte invariants for $2$-polymatroids /  |r James Oxley and Geoff Whittle --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01163  |t Extremal matroid theory /  |r Joseph P. S. Kung --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01164  |t Subexponentially computable truncations of Jones-type polynomials /  |r Teresa M. Przytycka and Józef H. Przytycki --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01165  |t Knots and braids: some algorithmic questions /  |r D. J. A. Welsh --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01166  |t A survey of linkless embeddings /  |r Neil Robertson, P. D. Seymour and Robin Thomas --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01167  |t Colin de Verdière -- On a new graph invariant and a criterion for planarity (This article is not available due to permission restrictions.)  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147  |t Four problems on plane graphs raised by Branko Grünbaum /  |r Oleg Borodin --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01169  |t Counterexamples to a conjecture of Las Vergnas and Meyniel /  |r Bruce Reed --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01170  |t An extremal function for the achromatic number /  |r Béla Bollobás, Bruce Reed and Andrew Thomason --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01171  |t The asymptotic structure of $H$-free graphs /  |r H. J. Prömel and A. Steger --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01172  |t Induced minors and related problems /  |r Michael Fellows, Jan Kratochvíl, Matthias Middendorf and Frank Pfeiffer --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01173  |t Induced circuits in graphs on surfaces /  |r Alexander Schrijver --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01174  |t Tree-representation of directed circuits /  |r András Frank and Tibor Jordán --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01175  |t Intercyclic digraphs /  |r William McCuaig --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01176  |t Eulerian trails through a set of terminals in specific, unique and all orders /  |r Jørgen Bang-Jensen and Svatopluk Poljak --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01177  |t $2$-reducible cycles containing two specified edges in $(2k+1)$-edge-connected graphs /  |r Haruko Okamura --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01178  |t Edge-disjoint cycles in $n$-edge-connected graphs /  |r Andreas Huck --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01179  |t Finding disjoint trees in planar graphs in linear time /  |r B. A. Reed, N. Robertson, A. Schrijver and P. D. Seymour --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01180  |t Surface triangulations without short noncontractible cycles /  |r Teresa M. Przytycka and Józef H. Przytycki --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01181  |t Representativity and flexibility on the projective plane /  |r R. P. Vitray --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01182  |t On nonnull separating circuits in embedded graphs /  |r Xiao Ya Zha and Yue Zhao --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01183  |t Projective-planar graphs with even duals. II /  |r Seiya Negami --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01184  |t $2$-factors, connectivity and graph minors /  |r Nathaniel Dean and Katsuhiro Ota --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01185  |t A conjecture in topological graph theory /  |r John Philip Huneke --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01186  |t On the closed $2$-cell embedding conjecture /  |r Xiao Ya Zha --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01187  |t Cycle cover theorems and their applications /  |r Cun-Quan Zhang --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/1188  |t Cones, lattices and Hilbert bases of circuits and perfect matchings /  |r Luis A. Goddyn --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01189  |t Regular maps from voltage assignments /  |r Pavol Gvozdjak and Jozef Širáň --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01190  |t The infinite grid covers the infinite half-grid /  |r Bogdan Oporowski --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01191  |t Dominating functions and topological graph minors /  |r Reinhard Diestel --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01192  |t Notes on rays and automorphisms of locally finite graphs /  |r H. A. Jung --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01193  |t Quasi-ordinals and proof theory /  |r L. Gordeev --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01194  |t Minor classes: extended abstract /  |r Dirk Vertigan --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01195  |t Well-quasi-ordering finite posets (extended abstract) /  |r Jens Gustedt --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01196  |t The immersion relation on webs /  |r Guoli Ding --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01197  |t Structural descriptions of lower ideals of trees /  |r Neil Robertson, P. D. Seymour and Robin Thomas --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01198  |t Finite automata, bounded treewidth and well-quasiordering /  |r Karl Abrahamson and Michael Fellows --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01199  |t Graph grammars, monadic second-order logic and the theory of graph minors /  |r Bruno Courcelle --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01200  |t Graph reductions, and techniques for finding minimal forbidden minors /  |r Andrzej Proskurowski --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01201  |t An upper bound on the size of an obstruction /  |r Jens Lagergren --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01202  |t An obstruction-based approach to layout optimization /  |r Michael A. Langston --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01203  |t Decomposing $3$-connected graphs /  |r Collette R. Coullard and Donald K. Wagner --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01204  |t Graph planarity and related topics /  |r A. K. Kelmans --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01205  |t Excluding a graph with one crossing /  |r Neil Robertson and Paul Seymour --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/01206  |t Open Problems /  |r Nathaniel Dean --  |u http://www.ams.org/conm/147/  |u http://dx.doi.org/10.1090/conm/147/45 
546 |a English. 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Graph theory  |v Congresses. 
650 6 |a Théorie des graphes  |v Congrès. 
650 7 |a Graph theory  |2 fast 
650 7 |a Graphes, théorie des  |x Congrès.  |2 ram 
655 7 |a Conference papers and proceedings  |2 fast 
700 1 |a Robertson, Neil,  |d 1938-  |1 https://id.oclc.org/worldcat/entity/E39PBJdrGxtB7QBrqxH6XMDpfq 
700 1 |a Seymour, Paul D. 
710 2 |a National Science Foundation (U.S.) 
710 1 |a United States.  |b Office of Naval Research. 
758 |i has work:  |a Graph structure theory (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCH88ThVK3MBMGGKFgvP6yq  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |a Robertson, Neil.  |t Graph Structure Theory.  |d Providence : American Mathematical Society, ©1993  |z 9780821851609 
830 0 |a Contemporary mathematics (American Mathematical Society) ;  |v v. 147. 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3112963  |z Texto completo 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL3112963 
938 |a ebrary  |b EBRY  |n ebr10873126 
938 |a YBP Library Services  |b YANK  |n 11827102 
938 |a Internet Archive  |b INAR  |n graphstructureth0000amsi 
994 |a 92  |b IZTAP 

Ejemplares similares