scientific article; zbMATH DE number 4110723

MaRDI QIDQ3834075zbMATH OpenFDO

Authors Andreas Schwill

Publication date 1988

zbMATH Keywords

distancegeodetically connected graphn-geodetically edge-connected

Mathematics Subject Classification ID

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

Recommendations

• Shortest edge-disjoint paths in graphs
• Towards minimumk-geodetically connected graphs
• Using a Geometric Lens to Find \(\boldsymbol{k}\)-Disjoint Shortest Paths
• On shortest disjoint paths in planar graphs
• On shortest disjoint paths in planar graphs
• Short disjoint paths in locally connected graphs
• Disjoint shortest paths in graphs
• Minimumk-geodetically connected digraphs
• CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
• A class of graph-geodetic distances generalizing the shortest-path and the resistance distances

Cited in

(3)

• Towards minimumk-geodetically connected graphs
• CONSTRAINED DISJOINT PATHS IN GEOMETRIC NETWORKS
• Disjoint shortest paths in 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 Q3834075)