Abstract
AbstractA longstanding open question of Archdeacon and Craft asks whether every complete graph has a minimum genus embedding with at most one nontriangular face. We exhibit such an embedding for each complete graph except for , and we go on to prove that no such embedding can exist for this graph. Our approach also solves a more general problem, giving a complete characterization of the possible face distributions (i.e., the numbers of faces of each length) realizable by minimum genus embeddings of each complete graph. We also tackle analogous questions for nonorientable and maximum genus embeddings.
Full Text
Accepted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call