| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910480208703321 |
|
|
Titolo |
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 |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Providence, Rhode Island : , : American Mathematical Society, , [1993] |
|
©1993 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Descrizione fisica |
|
1 online resource (706 p.) |
|
|
|
|
|
|
Collana |
|
Contemporary mathematics, , 0271-4132 ; ; 147 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Graph theory |
Electronic books. |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Description based upon print version of record. |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references. |
|
|
|
|
|
|
Nota di contenuto |
|
""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"" |
|
|
|
|
|
| |