Über reguläre Kettengruppen
From MaRDI portal
Publication:5731398
Recommendations
Cites work
- scientific article; zbMATH DE number 3121281 (Why is no real title available?)
- scientific article; zbMATH DE number 3121284 (Why is no real title available?)
- scientific article; zbMATH DE number 3121292 (Why is no real title available?)
- scientific article; zbMATH DE number 3121293 (Why is no real title available?)
- A Class Of Abelian Groups
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- A decomposition theorem for partially ordered sets
- A theorem on flows in networks
- Maximal Flow Through a Network
- Maximum-Minimum Sätze über Graphen
- Studies on directed graphs. I, II
Cited in
(8)- Flots et tensions dans un graphe
- Matroids and multicommodity flows
- The matroids with the max-flow min-cut property
- Generalizing the all-pairs min cut problem
- Tibor Gallai - seventy years old
- Tibor Gallai
- scientific article; zbMATH DE number 3298861 (Why is no real title available?)
- Algebraic flows in regular matroids
This page was built for publication: Über reguläre Kettengruppen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5731398)