The crossing numbers of several graphs of order eight with paths
Emília Draženská · Mathematical Modelling and Geometry · 2019
The crossing number of a simple graph G is the minimum number of edge crossings in any drawing of G in the plane. There are several classes of graphs for which crossing numbers have been published. One of them is the Cartesian product of two graphs. We give a new results by giving the exact values of crossing numbers of Cartesian product of a few graphs of order eight with paths.