Additional Information
Author(s) | KleÅ¡Ä, Marián, Kravecová, Daniela, Petrillová, Jana |
---|
There are known exact results of the crossing numbers of the Cartesian product of all graphs of order at most four with paths, cycles and stars. Moreover, for the path PnPn of length nn, the crossing numbers of Cartesian products G□PnG◻Pn for all connected graphs GG on five vertices and for forty graphs GG on six vertices are known. In this paper, we extend these results by determining the crossing numbers of the Cartesian products G□PnG◻Pn for six other graphs GG of order six.
Author(s) | KleÅ¡Ä, Marián, Kravecová, Daniela, Petrillová, Jana |
---|