The Klein bottle and multicommodity flows

DOI10.1007/BF02125349zbMath0708.05019OpenAlexW2005586399MaRDI QIDQ920100

Alexander Schrijver

Publication date: 1989

Published in: Combinatorica (Search for Journal in Brave)

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

zbMATH Keywords

Klein bottleEulerian graphdisjoint paths in planar graphsmaximum number of pairwise edge-disjoint orientation reversing circuitsminimum number of edges intersecting all orientation-reversing circuits

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (3)

Drawing disconnected graphs on the Klein bottle ⋮ On combinatorial properties of binary spaces ⋮ Multiflow Feasibility: An Annotated Tableau

Cites Work

• Distances and cuts in planar graphs
• Multicommodity flows in planar graphs
• The matroids with the max-flow min-cut property
• Multicommodity flows in graphs
• On the width—length inequality

This page was built for publication: The Klein bottle and multicommodity flows