Graph embeddings with no Hamiltonian extensions
Combinatorics
2023-10-04 v1
Abstract
We show that extending an embedding of a graph in a surface to an embedding of a Hamiltonian supergraph can be blocked by certain planar subgraphs but, for some subdivisions of , Hamiltonian extensions must exist.
Cite
@article{arxiv.2303.08306,
title = {Graph embeddings with no Hamiltonian extensions},
author = {Paul C. Kainen and Shannon Overbay},
journal= {arXiv preprint arXiv:2303.08306},
year = {2023}
}
Comments
6 pages, 2 figures; to appear in Bull. of the Inst. of Comb. and its Appl