A submodular measure and approximate Gomory-Hu theorem for packing odd trails

MaRDI QIDQ4607891zbMATH OpenFDO

Authors Ross Churchley, Bojan Mohar

Publication date 15 March 2018

Full work available at URL http://dl.acm.org/citation.cfm?id=3175281

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Weak duality for packing edge-disjoint odd \((u, v)\)-trails
• MIN-MAX theorems for packing and covering odd \((u,v)\)-trails
• Totally odd subdivisions and parity subdivisions: structures and coloring
• Odd path packings
• Flows and parity subgraphs of graphs with large odd-edge-connectivity

Cited in

(2)

• Weak duality for packing edge-disjoint odd \((u, v)\)-trails
• MIN-MAX theorems for packing and covering odd \((u,v)\)-trails

This page was built for publication: A submodular measure and approximate Gomory-Hu theorem for packing odd trails

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