The Minimum of the Maximum Rectilinear Crossing Numbers of Small Cubic Graphs
Matthew Alpert, Jens-P. Bode, Elie Feder, Heiko Harborth · CUNY Academic Works (City University of New York) · 2012
Here we consider the minimum of the maximum rectilinear crossing numbers for all d-regular graphs of order n. The case of connected graphs only is investigated also. For d = 3 exact values are determined for n are less than or equal to 12 and some estimations are given in general.