On the crossing numbers of Cartesian products with paths

Using a newly introduced operation on graphs and its counterpart on graph drawings, we prove the conjecture of Jendrol' and Ščerbová from 1982 about the crossing number of the Cartesian product K1,m□Pn. Our approach is applicable to the capped Cartesian products of Pn with any graph containing a dominating vertex.