On Linkedness of Cartesian Product of Graphs

Gabor Meszaros

Published 2014-01-30, updated 2014-07-27Version 2

We study linkedness of Cartesian product of graphs and prove that the product of an $a$-linked and a $b$-linked graphs is $(a+b-1)$-linked if the graphs are sufficiently large. Further bounds in terms of connectivity are shown. We determine linkedness of product of paths and product of cycles.