On the skewness of the generalized Heawood graphs
By the skewness of a graph, we mean the minimum number of its edges whose deletion results in a planar graph. We determine the skewness of a large family of cubic bipartite graphs (which includes the Heawood graph as a special case). Moreover, we also determine those classes of these cubic graphs wh...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2024-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/09728600.2024.2441817 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|