Ein kombinatorischer Beweis des Satzes von R. L. Ford und D. R. Fulkerson

DOI10.1007/BF01226027zbMath0371.05012OpenAlexW2011890075MaRDI QIDQ1243279

Anton Bigalke

Publication date: 1978

Published in: Archiv der Mathematik (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Maximal Flow Through a Network
• Short proof of Menger's graph theorem

This page was built for publication: Ein kombinatorischer Beweis des Satzes von R. L. Ford und D. R. Fulkerson