Bounds on path connectivity

DOI10.1016/0012-365X(84)90020-7zbMath0556.05043OpenAlexW2086530778MaRDI QIDQ761468

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)

Cites Work

• Disjoint paths in graphs
• 2-linked graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Universality considerations in VLSI circuits
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bounds on path connectivity