Applications of Menger's graph theorem

DOI10.1016/0022-247X(68)90163-7zbMath0157.55301MaRDI QIDQ2527630

Hazel Perfect

Publication date: 1968

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

zbMATH Keywords

topology

Related Items (44)

Maximum and optimal 1-2 matching problem of the different kind ⋮ Circuits through prescribed vertices in k‐connected k‐regular graphs ⋮ Finitary and cofinitary gammoids ⋮ A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter ⋮ $K_5^-$-Subdivision in 4-Connected Graphs ⋮ Heavy fans, cycles and paths in weighted graphs of large connectivity ⋮ Cycles and paths through specified vertices in k-connected graphs ⋮ Matroids and linking systems ⋮ The (theta, wheel)-free graphs. II: Structure theorem ⋮ Topological infinite gammoids, and a new Menger-type theorem for infinite graphs ⋮ On kernelization and approximation for the vector connectivity problem ⋮ Linking four vertices in graphs of large connectivity ⋮ A connection between sports and matroids: how many teams can we beat? ⋮ Infinite gammoids: minors and duality ⋮ A randomized polynomial kernel for subset feedback vertex set ⋮ Cycles through specified vertices of a graph ⋮ Cycle traversability for claw-free graphs and polyhedral maps ⋮ Cycles through a prescribed vertex set in \(n\)-connected graphs. ⋮ Induced Matroids ⋮ Cycles through three vertices in 2-connected graphs ⋮ Excluding 4‐Wheels ⋮ Tree-width of graphs without a \(3\times 3\) grid minor ⋮ Infinite gammoids ⋮ On a coloring conjecture of Hajós ⋮ \((s,m)\)-radius of \(k\)-connected graphs ⋮ Long cycles through specified vertices in a graph ⋮ Submodular functions and independence structures ⋮ Comments on certain combinatorial theorems of Ford and Fulkerson ⋮ K₅-Subdivisions in Graphs ⋮ Paths and cycles concerning independence edges ⋮ Extremal graphs without a semi-topological wheel ⋮ A parameterized view on matroid optimization problems ⋮ The Kelmans-Seymour conjecture. I: Special separations ⋮ The Kelmans-Seymour conjecture. II: 2-vertices in \(K_4^-\) ⋮ The Kelmans-Seymour conjecture. III: 3-vertices in \(K_4^-\) ⋮ The Kelmans-Seymour conjecture. IV: A proof ⋮ Gammoids and transversal matroids ⋮ Ore-type degree condition for heavy paths in weighted graphs ⋮ Connectivity for Kite-Linked Graphs ⋮ Rooted topological minors on four vertices ⋮ Unnamed Item ⋮ Subdivisions of \(K_5\) in graphs containing \(K_{2,3}\) ⋮ Pancyclism in Chvátal-Erdős' graphs ⋮ A Combinatorial Proof of the All Minors Matrix Tree Theorem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs and matching theorems
• A theorem on common transversals
• Comments on certain combinatorial theorems of Ford and Fulkerson
• Systems of Distinct Representations and Linear Programming
• Some Generalizations of the Problem of Distinct Representatives
• Note on Independence Functions
• On Representatives of Subsets
• Abstract linear dependence
• Transversals and matroid partition
• Short proof of Menger's graph theorem
• Applications of the notion of independence to problems of combinatorial analysis
• Independence Spaces and Combinatorial Problems
• Extensions of Menger's Theorem^†
• Axiomatic Treatment of Rank in Infinite Sets
• Distinct representatives of subsets
• The Marriage Problem
• A THEOREM ON INDEPENDENCE RELATIONS
• Systems of representatives

This page was built for publication: Applications of Menger's graph theorem