Smallest Cubic Graphs with Given Girth and Skewness

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.

Saved in:
Bibliographic Details
Published inITM Web of Conferences Vol. 67; p. 01028
Main Authors Chii Liang Ng, Chia, Gek L, Wong, Denis Chee-Keong
Format Conference Proceeding Journal Article
LanguageEnglish
Published Les Ulis EDP Sciences 01.01.2024
Subjects
Graph theory
Graphs
Skewness
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2431-7578
2271-2097
DOI:10.1051/itmconf/20246701028