On path-pairability in the Cartesian product of graphs

DOI10.7151/dmgt.1888zbMath1339.05341arXiv1401.7929OpenAlexW2346811671MaRDI QIDQ726652

Gábor Mészáros

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1401.7929

zbMATH Keywords

Cartesian product of graphspath-pairable graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)

Related Items

Linkage on the infinite grid, The terminal-pairability problem in complete bipartite graphs, On the maximum degree of path-pairable planar graphs, Terminal-pairability in complete bipartite graphs with non-bipartite demands. Edge-disjoint paths in complete bipartite graphs, Note on terminal-pairability in complete grid graphs, On the maximum diameter of path-pairable graphs, Path-pairability of infinite planar grids, The path-pairability number of product of stars

Cites Work

• Note on the diameter of path-pairable graphs
• Connectivity of Cartesian product graphs
• Three-regular path pairable graphs
• On connectivity of the cartesian product of two graphs
• Networks communicating for each pairing of terminals
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item