A counterexample to a conjecture on paths of bounded length

DOI10.1002/jgt.3190060215zbMath0494.05039OpenAlexW1981333947WikidataQ122911710 ScholiaQ122911710MaRDI QIDQ3956978

Geoffrey Exoo, Stephanie M. Boyles

Publication date: 1982

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190060215

zbMATH Keywords

distancemaximum number of openly disjoint paths

Mathematics Subject Classification ID

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

Related Items (7)

Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation ⋮ Fault diameter of interconnection networks ⋮ Large fault-tolerant interconnection networks ⋮ The Menger number of the Cartesian product of graphs ⋮ Menger-type theorems with restrictions on path lengths ⋮ On line disjoint paths of bounded length ⋮ Counterexamples to theorems of Menger type for the diameter

Cites Work

• Unnamed Item

This page was built for publication: A counterexample to a conjecture on paths of bounded length