Covering directed and odd cuts

DOI10.1007/BFb0121011zbMath0556.90060OpenAlexW132727820MaRDI QIDQ3220093

Éva Tardos, András Frank, András Sebő

Publication date: 1984

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0121011

zbMATH Keywords

partitionsmatchingorientationstrong connectivityundirected graphsChinese postmanminimum cardinalityparity conditionscoverings of directed and odd cuts

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Combinatorial aspects of packing and covering (05B40)

Related Items

Conservative weightings and ear-decompositions of graphs, A quick proof of Seymour's theorem on t-joins, Undirected distances and the postman-structure of graphs, The Schrijver system of odd join polyhedra, Generalized polymatroids and submodular flows, An application of submodular flows, On orientations and shortest paths, Modulo orientations with bounded out-degrees, On a min--max theorem on bipartite graphs, Tree-compositions and orientations, Finding thet-join structure of graphs, On shortest \(T\)-joins and packing \(T\)-cuts, A note on parity constrained orientations, On T-joins and odd factors, A generalization of Petersen's theorem