On shortest \(T\)-joins and packing \(T\)-cuts
From MaRDI portal
Publication:1210583
DOI10.1016/0095-8956(92)90032-SzbMath0810.05056MaRDI QIDQ1210583
Publication date: 7 February 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C35: Extremal problems in graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
Vertex set partitions preserving conservativeness, An Excluded Minor Characterization of Seymour Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A quick proof of Seymour's theorem on t-joins
- Undirected distances and the postman-structure of graphs
- Matrices with the Edmonds-Johnson property
- The Schrijver system of odd join polyhedra
- Tight integral duality gap in the Chinese postman problem
- The matroids with the max-flow min-cut property
- Finding thet-join structure of graphs
- Covering directed and odd cuts
- On Odd Cuts and Plane Multicommodity Flows
- 2-Matchings and 2-covers of hypergraphs
- Matching, Euler tours and the Chinese postman