Bounds on path connectivity

DOI10.1016/0012-365X(84)90020-7zbMATH Open0556.05043OpenAlexW2086530778MaRDI QIDQ761468FDOQ761468

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

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

zbMATH Keywords

path-connected graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• 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
• Disjoint paths in graphs
• 2-linked graphs
• Finding Two Disjoint Paths Between Two Pairs of Vertices in a Graph
• Universality considerations in VLSI circuits
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (5)

• The \(k\)-subconnectedness of planar graphs
• Paths with restricted degrees of their vertices in planar graphs
• Title not available (Why is that?)
• On the maximum degree of path-pairable planar graphs
• Tight bounds for connecting sites across barriers

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)