Simple numerical algorithm for generating Hamiltonian cycles and edge labels on planar cubic maps
Combinatorics
2021-04-14 v1
Abstract
In this work we present an algorithm with which any arbitrary cubic planar map may be constructed through successive edge insertion while simultaneously constructing a set of proper edge labels and Hamiltonian cycles for each configuration. We present a publicly available Python implementation of this algorithm, and discuss both theoretical and numerical support for its validity, with reference to the well-known Four Colour Theorem.
Keywords
Cite
@article{arxiv.2104.05896,
title = {Simple numerical algorithm for generating Hamiltonian cycles and edge labels on planar cubic maps},
author = {Emily Kendall},
journal= {arXiv preprint arXiv:2104.05896},
year = {2021}
}