Thin Hamiltonian cycles on Archimedean graphs

Archimedean graphs are finite subgraphs of an Archimedean tiling. If such a graph has a thin Hamiltonian cycle, then various area functions of the cycle are shown to be graph invariants, depending on the graph itself, but not on the particular thin Hamiltonian cycle.