Disjoint shortest paths in graphs

DOI10.1007/BF02579137zbMATH Open0558.05034OpenAlexW2021575509MaRDI QIDQ762495FDOQ762495

Authors: 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

Recommendations

• scientific article; zbMATH DE number 4110723
• Shortest edge-disjoint paths in graphs
• A characterization of geodetic graphs
• The \(k\)-edge geodetic number of a graph
• Minimum 3-geodetically connected graphs

zbMATH Keywords

geodetically connectedlinkagegeodetic linkageset of paths

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (7)

• The Directed Disjoint Shortest Paths Problem
• Short disjoint paths in locally connected graphs
• Disjoint paths in symmetric digraphs
• Title not available (Why is that?)
• Shortest Paths between Shortest Paths and Independent Sets
• Shortest edge-disjoint paths in graphs
• Towards minimumk-geodetically connected graphs

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

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