Disjoint shortest paths in graphs

DOI10.1007/BF02579137zbMath0558.05034OpenAlexW2021575509MaRDI QIDQ762495

Hikoe Enomoto, Akira Saito

Publication date: 1984

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579137

zbMATH Keywords

geodetically connectedlinkagegeodetic linkageset of paths

Mathematics Subject Classification ID

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

Related Items (2)

Towards minimumk-geodetically connected graphs ⋮ Shortest edge-disjoint paths in graphs

Cites Work

• 2-linked graphs
• Geodetic connectivity of graphs
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes

This page was built for publication: Disjoint shortest paths in graphs