Packing odd T‐joins with at most two terminals

DOI10.1002/jgt.22178zbMath1386.05147arXiv1410.7423OpenAlexW2962878651MaRDI QIDQ4638649

Guenin, Bertrand, Ahmad Abdi

Publication date: 27 April 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.7423

zbMATH Keywords

network flowsweakly bipartite graphsbinary clutterscycling conjectureodd st-joins

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (2)

A survey on flows in graphs and matroids ⋮ Clean Clutters and Dyadic Fractional Packings

This page was built for publication: Packing odd T‐joins with at most two terminals