On path-pairability of the finite grids

DOI10.1007/S40879-018-0306-1zbMATH Open1425.05037OpenAlexW2902551874MaRDI QIDQ2010412FDOQ2010412

Authors: Adam S. Jobson, André E. Kézdy, Jeno 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

Recommendations

• Path-pairability of infinite planar grids
• Linkage on the infinite grid
• scientific article; zbMATH DE number 434691
• Note on the diameter of path-pairable graphs
• The path-pairability number of product of stars

zbMATH Keywords

connectivityinterconnection networkslinkagepath-pairabilityfinite grid

Mathematics Subject Classification ID

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

Cites Work

• Charming proofs. A journey into elegant mathematics
• Title not available (Why is that?)
• Networks communicating for each pairing of terminals
• 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

Cited In (8)

• On the maximum diameter of path-pairable graphs
• Linkage on the infinite grid
• The path-pairability number of product of stars
• Path-pairability of infinite planar grids
• On the number of shortest paths by neighborhood sequences on the square grid
• Note on terminal-pairability in complete grid graphs
• On path-pairability in the Cartesian product of graphs
• On the Non-additive Sets of Uniqueness in a Finite Grid

This page was built for publication: On path-pairability of the finite grids

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