Path-pairability of infinite planar grids

DOI10.1007/s10998-021-00381-2zbMath1499.05168OpenAlexW3165843763MaRDI QIDQ2052787

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

Publication date: 27 November 2021

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10998-021-00381-2

zbMATH Keywords

Linkageinterconnection networkspath-pairabilityinfinite grid

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40) Infinite graphs (05C63)

Cites Work

• On path-pairability in the Cartesian product of graphs
• Escaping a grid by edge-disjoint paths
• Linkage on the infinite grid
• On path-pairability of the finite grids
• The path-pairability number of product of stars
• Networks communicating for each pairing of terminals
• Unnamed Item

This page was built for publication: Path-pairability of infinite planar grids