The crossing numbers of products of paths with 7–vertex trees
Emília Draženská · Creative Mathematics and Informatics · 2014
The crossing numbers of Cartesian products of paths with all graphs of order at most five are given. The crossing numbers of Cartesian products of paths with several graphs on six vertices are known. We extend these results by giving the exact values or upper bound of crossing numbers of Cartesian products G Pn for every tree G on seven vertices.