Covering directed and odd cuts

DOI10.1007/BFB0121011MaRDI QIDQ3220093zbMATH OpenOpenAlexFDO

Authors András Frank, Éva Tardos, 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

Chinese postmancoverings of directed and odd cutsmatchingminimum cardinalityorientationparity conditionspartitionsstrong connectivityundirected graphs

Mathematics Subject Classification ID

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

Recommendations

• Multi-budgeted directed cuts
• Multi-budgeted directed cuts
• Extended cuts
• Covering Moves
• On covers
• Cutting Out Continuations
• Covering odd cycles
• The cutting of compositions
• The cutting of compositions
• The final cut

Cited in

(21)

• 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
• On shortest T-joins and packing T-cuts
• On a min--max theorem on bipartite graphs
• A generalization of Petersen's theorem
• On the integral 4-packing of \(T\)-cuts
• Conservative weightings and ear-decompositions of graphs
• Tree-compositions and orientations
• Extended cuts
• Special minimum cuts in directed graphs: note.
• Finding thet-join structure of graphs
• scientific article; zbMATH DE number 808809 (Why is no real title available?)
• scientific article; zbMATH DE number 2246594 (Why is no real title available?)
• On T-joins and odd factors
• Modulo orientations with bounded out-degrees
• The Lovász-Cherkassky theorem in infinite graphs
• A note on parity constrained orientations

This page was built for publication: Covering directed and odd cuts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3220093)