crossing number graph

The smallest cubic graphs with graph crossing number CN(G) = n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo. The n-crossing graphs are implemented in the Wolfram Language as GraphData[CrossingNumberGraphNA], with N being a number and X a letter, for example 3C for the Heawood graph or 8B for cubic symmetric graph F_24 A.

cubic graph | graph crossing number | rectilinear crossing number