Mengerian theorems for paths of bounded length

From MaRDI portal
Publication:1252354

DOI10.1007/BF02019432zbMath0393.05033MaRDI QIDQ1252354

László Lovász, Michael D. Plummer, Víctor Neumann-Lara

Publication date: 1978

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)




Related Items

On Fault-Tolerant Low-Diameter Clusters in Graphs, Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation, An extended network interdiction problem for optimal toll control, Large fault-tolerant interconnection networks, On Saito's conjecture and the Oberly-Sumner conjectures, Unnamed Item, Shortest edge-disjoint paths in graphs, The Menger number of the strong product of graphs, A constraint programming approach to the additional relay placement problem in wireless sensor networks, Couplages et transversaux généralises d'un hypergraphe infini, Unnamed Item, Paths of bounded length and their cuts: parameterized complexity and algorithms, Parsimonious formulations for low-diameter clusters, A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints, The Optimal Design of Low-Latency Virtual Backbones, On Algorithms Employing Treewidth for $L$-bounded Cut Problems, The Complexity of Finding Small Separators in Temporal Graphs, Short disjoint paths in locally connected graphs, Generalized degrees and Menger path systems, Menger-type theorems with restrictions on path lengths, High-dimensional structure estimation in Ising models: local separation criterion, Bounded edge-connectivity and edge-persistence of Cartesian product of graphs, The complexity of finding small separators in temporal graphs, Connectivity properties of random subgraphs of the cube, Searching for a Visible, Lazy Fugitive, Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms, On line disjoint paths of bounded length, Counterexamples to theorems of Menger type for the diameter, A variation of Menger's theorem for long paths, Vulnerability in graphs of diameter four



Cites Work