On path-pairability of the finite grids

DOI10.1007/s40879-018-0306-1zbMath1425.05037OpenAlexW2902551874MaRDI QIDQ2010412

André E. Kézdy, Adam S. Jobson, Jenő Lehel

Publication date: 27 November 2019

Published in: European Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40879-018-0306-1

zbMATH Keywords

connectivityinterconnection networkslinkagepath-pairabilityfinite grid

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items

Path-pairability of infinite planar grids ⋮ The path-pairability number of product of stars

Cites Work

• Note on the diameter of path-pairable graphs
• Escaping a grid by edge-disjoint paths
• The path-pairability number of product of stars
• Terminal-Pairability in Complete Graphs
• Networks communicating for each pairing of terminals
• Unnamed Item
• Unnamed Item