Maximum-Minimum Sätze über Graphen
From MaRDI portal
Publication:3252412
DOI10.1007/BF02020271zbMath0084.19603WikidataQ29013460 ScholiaQ29013460MaRDI QIDQ3252412
Publication date: 1958
Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)
Related Items
On odd circuits in chromatic graphs, Über reguläre Kettengruppen, Systems of representatives, Generating all vertices of a polyhedron is hard, A min-max relation for stable sets in graphs with no odd-\(K_ 4\), On short paths interdiction problems: Total and node-wise limited interdiction, Disjoint paths in a rectilinear grid, On separating sets of edges in contraction-critical graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Studies on directed graphs. I, II
- A theorem on flows in networks
- A decomposition theorem for partially ordered sets
- Maximal Flow Through a Network
- A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
- Ein Neuer Beweis Eines Mengerschen Satzes
- The 1-Factors of Oriented Graphs