The Structure of the Heawood Graph
Emille Davie Lawrence, Robin T. Wilson

TL;DR
This paper analyzes the cycle structure of the Heawood graph, detailing automorphism actions and enumerations of various cycles, enhancing understanding of its symmetry and combinatorial properties.
Contribution
It provides a detailed description of the cycle structure and automorphism group actions on the Heawood graph, including enumeration of specific cycles and cycle pairs.
Findings
Automorphism group acts transitively on 12-cycles, Hamiltonian cycles, and disjoint 6-cycle pairs.
Enumerates 12-, 10-, and 8-cycles in the Heawood graph.
Counts pairs of disjoint 6-cycles in the graph.
Abstract
We give a description of the cycle structure of the Heawood graph, . In particular, we prove that the automorphism group of acts transitively on the set of -cycles, Hamiltonian cycles, and disjoint pairs of -cycles. We also enumerate -, -, and -cycles in , as well as pairs of disjoint -cycles.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputational Geometry and Mesh Generation · Graph Labeling and Dimension Problems · graph theory and CDMA systems
