Coverart for item
The Resource 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, Neil Robertson, Paul Seymour, editors

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, Neil Robertson, Paul Seymour, editors

Label
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
Title
Graph structure theory
Title remainder
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
Statement of responsibility
Neil Robertson, Paul Seymour, editors
Creator
Contributor
Editor
Issuing body
Subject
Genre
Language
  • eng
  • eng
Member of
Cataloging source
MiAaPQ
http://bibfra.me/vocab/relation/corporateauthor
RwiS3tNyiIc
Dewey number
511/.5
Illustrations
illustrations
Index
no index present
Language note
English
LC call number
QA166
LC item number
.A48 1991
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
1991
http://bibfra.me/vocab/lite/meetingName
AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors
Nature of contents
  • dictionaries
  • bibliography
http://bibfra.me/vocab/lite/organizationName
AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors
http://library.link/vocab/relatedWorkOrContributorDate
1938-
http://library.link/vocab/relatedWorkOrContributorName
  • AMS-IMS-SIAM Joint Summer Research Conference on Graph Minors
  • National Science Foundation (U.S.)
  • United States
  • Robertson, Neil
  • Seymour, Paul D.
Series statement
Contemporary mathematics,
Series volume
147
http://library.link/vocab/subjectName
Graph theory
Label
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, Neil Robertson, Paul Seymour, editors
Instantiates
Publication
Copyright
Note
Description based upon print version of record
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
cr
Content category
text
Content type code
txt
Contents
  • ""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""
  • ""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""
  • ""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""
  • ""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""
  • ""11. An ear-like decomposition for quasi 4-connected graphs""
Dimensions
unknown
Extent
1 online resource (706 p.)
Form of item
online
Isbn
9780821877388
Media category
computer
Media type code
c
Specific material designation
remote
System control number
  • (CKB)3240000000069676
  • (EBL)3112963
  • (SSID)ssj0000629325
  • (PQKBManifestationID)11388859
  • (PQKBTitleCode)TC0000629325
  • (PQKBWorkID)10731161
  • (PQKB)10652947
  • (MiAaPQ)EBC3112963
  • (EXLCZ)993240000000069676
Label
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, Neil Robertson, Paul Seymour, editors
Publication
Copyright
Note
Description based upon print version of record
Bibliography note
Includes bibliographical references
Carrier category
online resource
Carrier category code
cr
Content category
text
Content type code
txt
Contents
  • ""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""
  • ""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""
  • ""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""
  • ""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""
  • ""11. An ear-like decomposition for quasi 4-connected graphs""
Dimensions
unknown
Extent
1 online resource (706 p.)
Form of item
online
Isbn
9780821877388
Media category
computer
Media type code
c
Specific material designation
remote
System control number
  • (CKB)3240000000069676
  • (EBL)3112963
  • (SSID)ssj0000629325
  • (PQKBManifestationID)11388859
  • (PQKBTitleCode)TC0000629325
  • (PQKBWorkID)10731161
  • (PQKB)10652947
  • (MiAaPQ)EBC3112963
  • (EXLCZ)993240000000069676

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...