Counterexamples to theorems of Menger type for the diameter

DOI10.1016/0012-365X(83)90062-6zbMath0509.05054OpenAlexW2027656969WikidataQ124881004 ScholiaQ124881004MaRDI QIDQ1838498

J. A. Bondy, Pavol Hell

Publication date: 1983

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(83)90062-6

zbMATH Keywords

diameterMenger- type resultspersistence of graphsvulnerability in communication networks

Mathematics Subject Classification ID

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

Related Items

Fault diameter of interconnection networks ⋮ Large fault-tolerant interconnection networks ⋮ Vulnerability in graphs of diameter four

Cites Work

• Unnamed Item
• Mengerian theorems for paths of bounded length
• Graphs as models of communication network vulnerability: Connectivity and persistence
• A counterexample to a conjecture on paths of bounded length
• Geodetic connectivity of graphs
• The complexity of finding maximum disjoint paths with length constraints

This page was built for publication: Counterexamples to theorems of Menger type for the diameter