On the Crossing Numbers of Certain Products
by
M. Klešč
Košice

The crossing number cr(G) of a graph G is the smallest number of pairs of nonadjacent edges that intersect in any drawing of G in the plane. The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. It thus seems natural to inquire about the crossing numbers of the products of 5-vertex graphs with cycles, paths or stars. In several papers are completed the crossing numbers of Cartesian products of all 5-vertex graphs with paths. Our talk deals with the crossing numbers of products of cycles and graphs or order five.

Date received: May 26, 2000

Copyright © 2000 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # cafd-14.