The Minimum of the Maximum Rectilinear Crossing Numbers of Small Cubic Graphs

Authors

Matthew Alpert, Harvard University
Jens-P. Bode, Technische Universitat Braunschweig
Elie Feder, CUNY Kingsborough Community CollegeFollow
Heiko Harborth, Technische Universitat Braunschweig

Document Type

Article

Publication Date

2012

Abstract

Here we consider the minimum of the maximum rectilin­ear 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.

Comments

This work was originally published in Congressus Numerantium.