Path-pairability of infinite planar grids

DOI10.1007/S10998-021-00381-2MaRDI QIDQ2052787zbMATH OpenOpenAlexFDO

Authors Adam S. Jobson, André E. Kézdy, Jeno Lehel

Publication date 27 November 2021

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

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

infinite gridinterconnection networksLinkagepath-pairability

Mathematics Subject Classification ID

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

Recommendations

• Linkage on the infinite grid
• On path-pairability of the finite grids
• On the maximum degree of path-pairable planar graphs
• scientific article; zbMATH DE number 434691
• Note on terminal-pairability in complete grid graphs

Cites work

• Escaping a grid by edge-disjoint paths
• scientific article; zbMATH DE number 90343 (Why is no real title available?)
• Linkage on the infinite grid
• Networks communicating for each pairing of terminals
• On path-pairability in the Cartesian product of graphs
• On path-pairability of the finite grids
• The path-pairability number of product of stars

Cited in

(6)

• Linkage on the infinite grid
• On path-pairability of the finite grids
• On the maximum degree of path-pairable planar graphs
• scientific article; zbMATH DE number 434691 (Why is no real title available?)
• scientific article; zbMATH DE number 475606 (Why is no real title available?)
• On path-pairability in the Cartesian product of graphs

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

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