Graph Structure Theory. (Record no. 68498)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 04812nam a22004693i 4500 |
| 001 - CONTROL NUMBER | |
| control field | EBC3112963 |
| 003 - CONTROL NUMBER IDENTIFIER | |
| control field | MiAaPQ |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20240729124529.0 |
| 006 - FIXED-LENGTH DATA ELEMENTS--ADDITIONAL MATERIAL CHARACTERISTICS | |
| fixed length control field | m o d | |
| 007 - PHYSICAL DESCRIPTION FIXED FIELD--GENERAL INFORMATION | |
| fixed length control field | cr cnu|||||||| |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 240724s1993 xx o ||||0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| International Standard Book Number | 9780821877388 |
| Qualifying information | (electronic bk.) |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| Canceled/invalid ISBN | 9780821851609 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (MiAaPQ)EBC3112963 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (Au-PeEL)EBL3112963 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (CaPaEBR)ebr10873126 |
| 035 ## - SYSTEM CONTROL NUMBER | |
| System control number | (OCoLC)922980334 |
| 040 ## - CATALOGING SOURCE | |
| Original cataloging agency | MiAaPQ |
| Language of cataloging | eng |
| Description conventions | rda |
| -- | pn |
| Transcribing agency | MiAaPQ |
| Modifying agency | MiAaPQ |
| 050 #4 - LIBRARY OF CONGRESS CALL NUMBER | |
| Classification number | QA166 -- .A48 1991eb |
| 082 0# - DEWEY DECIMAL CLASSIFICATION NUMBER | |
| Classification number | 511/.5 |
| 100 1# - MAIN ENTRY--PERSONAL NAME | |
| Personal name | Robertson, Neil. |
| 245 10 - TITLE STATEMENT | |
| Title | Graph Structure Theory. |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. |
| 264 #1 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Place of production, publication, distribution, manufacture | Providence : |
| Name of producer, publisher, distributor, manufacturer | American Mathematical Society, |
| Date of production, publication, distribution, manufacture, or copyright notice | 1993. |
| 264 #4 - PRODUCTION, PUBLICATION, DISTRIBUTION, MANUFACTURE, AND COPYRIGHT NOTICE | |
| Date of production, publication, distribution, manufacture, or copyright notice | ©1993. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Extent | 1 online resource (706 pages) |
| 336 ## - CONTENT TYPE | |
| Content type term | text |
| Content type code | txt |
| Source | rdacontent |
| 337 ## - MEDIA TYPE | |
| Media type term | computer |
| Media type code | c |
| Source | rdamedia |
| 338 ## - CARRIER TYPE | |
| Carrier type term | online resource |
| Carrier type code | cr |
| Source | rdacarrier |
| 490 1# - SERIES STATEMENT | |
| Series statement | Contemporary Mathematics ; |
| Volume/sequential designation | v.147 |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | Intro -- Contents -- Preface -- Alphabetical list of authors -- Polynomials -- Tutte invariants for 2-polymatroids -- Extremal matroid theory -- Subexponentially computable truncations of Jones-type polynomials -- Knots and braids: Some algorithmic questions -- A survey of linkless embeddings -- On a new graph invariant and a criterion for planarity -- Four problems on plane graphs raised by Branko Grünbaum -- Counterexamples to a conjecture of Las Vergnas and Meyniel -- An extremal function for the achromatic number -- The asymptotic structure of H-free graphs -- 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. |
| 505 8# - FORMATTED CONTENTS NOTE | |
| Formatted contents note | 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 -- 12. Non-separating circuits in quasi 4-connected graphs -- 13. Some refinements of Whitney's planarity criterion -- 14. On Dirac's conjecture -- 15. On Barnette's conjecture -- References -- Excluding a graph with one crossing -- Open problems. |
| 588 ## - SOURCE OF DESCRIPTION NOTE | |
| Source of description note | Description based on publisher supplied metadata and other sources. |
| 590 ## - LOCAL NOTE (RLIN) | |
| Local note | Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. |
| 650 #0 - SUBJECT ADDED ENTRY--TOPICAL TERM | |
| Topical term or geographic name entry element | Graph theory -- Congresses. |
| 655 #4 - INDEX TERM--GENRE/FORM | |
| Genre/form data or focus term | Electronic books. |
| 700 1# - ADDED ENTRY--PERSONAL NAME | |
| Personal name | Seymour, Paul. |
| 776 08 - ADDITIONAL PHYSICAL FORM ENTRY | |
| Relationship information | Print version: |
| Main entry heading | Robertson, Neil |
| Title | Graph Structure Theory |
| Place, publisher, and date of publication | Providence : American Mathematical Society,c1993 |
| International Standard Book Number | 9780821851609 |
| 797 2# - LOCAL ADDED ENTRY--CORPORATE NAME (RLIN) | |
| Corporate name or jurisdiction name as entry element | ProQuest (Firm) |
| 830 #0 - SERIES ADDED ENTRY--UNIFORM TITLE | |
| Uniform title | Contemporary Mathematics |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | <a href="https://ebookcentral.proquest.com/lib/orpp/detail.action?docID=3112963">https://ebookcentral.proquest.com/lib/orpp/detail.action?docID=3112963</a> |
| Public note | Click to View |
No items available.