On path-pairability in the Cartesian product of graphs
Gábor Mészáros · Discussiones Mathematicae Graph Theory · 2016
We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive and multiplicative inheritance patterns of pathpairability, depending on the number of vertices in the Cartesian product. We present path-pairable graph families that improve the known upper bound on the minimal maximum degree of a path-pairable graph. Further results and open questions about path-pairability are also presented.