The Structure of the Heawood Graph
From MaRDI portal
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.
Recommendations
- Some properties of the Heawood graph
- scientific article; zbMATH DE number 994577
- scientific article; zbMATH DE number 4103118
- scientific article; zbMATH DE number 617551
- scientific article; zbMATH DE number 1439474
- On the Structure of Edge Graphs
- On the structure of graphs in the Caucal hierarchy
- Note on the Structure of Graphs
- On graphoidal graphs of a tree
- On a heuristic and the graphs reconstructed by it
Cited in
(2)
This page was built for publication: The Structure of the Heawood Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995340)