On the skewness of the generalized Heawood graphs
Chii Liang Ng, Gek L. Chia, Denis Chee-Keong Wong
AKCE International Journal of Graphs and Combinatorics · 2025
doi:10.1080/09728600.2024.2441817 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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 which are [Formula: see text]-skew whose resulting plane graphs (upon deleting the right minimum number of edges) are hexagulations.
Abstract licence: CC BY-NC
References18
18 more references, whose wording the paper’s licence keeps private.
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.