scientific article; zbMATH DE number 3845615

MaRDI QIDQ3315542zbMATH OpenFDO

Authors Daniela Šafaříková, Ludovit Niepel

Publication date 1983

zbMATH Keywords

edge-disjoint paths of bounded lengthline- connectivityMengerian theorems

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 4059450
• Menger-type theorems with restrictions on path lengths
• Edge-disjoint paths and cycles inn-edge-connected graphs
• A mixed version of Menger's theorem
• scientific article; zbMATH DE number 4144025

Cited in

(18)

• A mixed version of Menger's theorem
• Generalized degrees and Menger path systems
• A generalization of a theorem of Mammana
• scientific article; zbMATH DE number 5137213 (Why is no real title available?)
• Paths of bounded length and their cuts: parameterized complexity and algorithms
• On the equivalence of Minty's painting theorem and Tellegen's theorem
• scientific article; zbMATH DE number 1263226 (Why is no real title available?)
• Paths of bounded length and their cuts: parameterized complexity and algorithms
• scientific article; zbMATH DE number 2109101 (Why is no real title available?)
• Routing of electric vehicles: constrained shortest path problems with resource recovering nodes
• scientific article; zbMATH DE number 6769191 (Why is no real title available?)
• On one generalization of a DiPerna and Majda theorem
• scientific article; zbMATH DE number 3037242 (Why is no real title available?)
• On an induced version of Menger's theorem
• Menger-type theorems with restrictions on path lengths
• A variation of Menger's theorem for long paths
• The strength of Menger's conjecture
• Bounded edge-connectivity and edge-persistence of Cartesian product of graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3315542)