Short disjoint paths in locally connected graphs

DOI10.1007/S00373-007-0754-8MaRDI QIDQ2464055zbMATH OpenOpenAlexFDO

Authors Ciping Chen, Roman Čada, Tomáš Kaiser, Zdeněk Ryjáček

Publication date 10 December 2007

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-007-0754-8

zbMATH Keywords

Connectivitydiameterdisjoint pathslocal connectivity

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Disjoint shortest paths in graphs
• scientific article; zbMATH DE number 4162905
• Shortest edge-disjoint paths in graphs
• scientific article; zbMATH DE number 4089593
• On shortest disjoint paths in planar graphs
• On shortest disjoint paths in planar graphs
• Disjoint paths in sparse graphs
• Shortest node-disjoint paths on random graphs
• Some results on the path locality of simple connected graphs
• Length-bounded disjoint paths in planar graphs

Cites work

• scientific article; zbMATH DE number 863470 (Why is no real title available?)
• Locally connected graphs
• Mengerian theorems for paths of bounded length

Cited in

(3)

• scientific article; zbMATH DE number 4144026 (Why is no real title available?)
• scientific article; zbMATH DE number 4110723 (Why is no real title available?)
• Shortest edge-disjoint paths in graphs

This page was built for publication: Short disjoint paths in locally connected graphs

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