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.
Publication Details
- Journal
- Springer Link (Chiba Institute of Technology)
- Published
- 2024-08-21
- DOI
- https://doi.org/10.1051/itmconf/20246701028/pdf
- Primary Topic
- Mycorrhizal Fungi and Plant Interactions
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- Universiti Tunku Abdul Rahman
- Division of Mathematical Sciences