Bounds on path connectivity

DOI10.1016/0012-365X(84)90020-7MaRDI QIDQ761468zbMATH OpenOpenAlexFDO

Authors Alon Itai, Avram Zehavi

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(84)90020-7

zbMATH Keywords

path-connected graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Recommendations

• Paths and edge-connectivity in graphs
• The \(k\)-subconnectedness of planar graphs
• The maximal size of graphs with at most \(k\) edge-disjoint paths connecting any two adjacent vertices
• scientific article; zbMATH DE number 1536527
• Two paths joining given vertices in \(2k\)-edge-connected graphs

Cites work

• scientific article; zbMATH DE number 3648730 (Why is no real title available?)
• scientific article; zbMATH DE number 3947966 (Why is no real title available?)
• scientific article; zbMATH DE number 3550190 (Why is no real title available?)
• 2-linked graphs
• Disjoint paths in graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Universality considerations in VLSI circuits

Cited in

(5)

• The \(k\)-subconnectedness of planar graphs
• scientific article; zbMATH DE number 1744097 (Why is no real title available?)
• Tight bounds for connecting sites across barriers
• On the maximum degree of path-pairable planar graphs
• Paths with restricted degrees of their vertices in planar graphs

This page was built for publication: Bounds on path connectivity

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