Smallest Cubic Graphs with Given Girth and Skewness

Abstract

The skewness of a graph is the minimum number of its edges whose deletion results in a planar graph. We determine the minimum orders of cubic graphs with girth no more than 6 and skewness no more than 4. In passing, we also determine the skewness of all cubic cages whose girth is no more than 8.