Maximum-Minimum Sätze über Graphen

DOI10.1007/BF02020271zbMath0084.19603OpenAlexW2317303422WikidataQ29013460 ScholiaQ29013460MaRDI QIDQ3252412

Tibor Gallai

Publication date: 1958

Published in: Acta Mathematica Academiae Scientiarum Hungaricae (Search for Journal in Brave)

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

zbMATH Keywords

topology

Related Items

Weighted digraphs and tropical cones, On odd circuits in chromatic graphs, The non-positive circuit weight problem in parametric graphs: a solution based on dioid theory, Characterization of the Walrasian equilibria of the assignment model, A potential reduction algorithm for two-person zero-sum mean payoff stochastic games, On canonical forms for zero-sum stochastic mean payoff games, \(\mathsf{PPAD}\)-completeness of polyhedral versions of Sperner's lemma, A novel parameterised approximation algorithm for \textsc{minimum vertex cover}, Domination parameters with number 2: interrelations and algorithmic consequences, On Nash equilibria and improvement cycles in pure positional strategies for chess-like and backgammon-like \(n\)-person games, Adjacencies on random ordering polytopes and flow polytopes, On the complexity of compressing two dimensional routing tables with order, Nash-solvable two-person symmetric cycle game forms, On Nash-solvability in pure stationary strategies of the deterministic \(n\)-person games with perfect information and mean or total effective cost, A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs, On short paths interdiction problems: Total and node-wise limited interdiction, Brush your trees!, A tropical isoperimetric inequality, Perfect zero-divisor graphs, Über reguläre Kettengruppen, Kernels for packing and covering problems, A min-max relation for stable sets in graphs with no odd-\(K_ 4\), Systems of representatives, Generating all vertices of a polyhedron is hard, On separating sets of edges in contraction-critical graphs, Disjoint paths in a rectilinear grid, The GKK algorithm is the fastest over simple mean-payoff games

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