AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Polyhedral Combinatorics
About this Title
William Cook and P D. Seymour, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1990; Volume 1
ISBN: 978-0-8218-6591-0 (print)
DOI: https://doi.org/10.1090/dimacs/001
MathSciNet review: MR1105110
MSC: Primary 90-06; Secondary 05-06
This volume is not part of this online collection.
Table of Contents
Chapters
- Matrix cones, projection representations, and stable set polyhedra
- A generalization of Lovász’s $\theta $ function
- On cutting planes and matrices
- Random volumes in the $n$-cube
- Test sets for integer programs, $\forall \exists $ sentences
- Solvable classes of generalized traveling salesman problems
- Handles and teeth in the symmetric traveling salesman polytope
- On the complexity of branch and cut methods for the traveling salesman problem
- Existentially polytime theorems
- The width-length inequality and degenerate projective planes
- On Lehman’s width-length characterization
- Applications of polyhedral combinatorics to multicommodity flows and compact surfaces
- Vertex-disjoint simple paths of given homotopy in a planar graph
- On disjoint homotopic paths in the plane
- On the complexity of the disjoint paths problem (extended abstract)
- The paths-selection problem
- Planar multicommodity flows, max cut, and the Chinese postman problem
- The cographic multiflow problem: An epilogue
- Exact edge-colorings of graphs without prescribed minors
- On the chromatic index of multigraphs and a conjecture of Seymour, (II)
- Spanning trees of different weights