An optimal construction for complete graph embeddings with duals of low connectivity

DOI10.1016/J.DISC.2025.114628MaRDI QIDQ6933605zbMATH OpenFDO

Authors Timothy Sun

Publication date 4 September 2025

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2025.114628

zbMATH Keywords

complete graphcurrent graphdual graph

Mathematics Subject Classification ID

Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Relations of low-dimensional topology with graph theory (57M15)

Cites work

• A simple construction for orientable triangular embeddings of the complete graphs on 12 s vertices
• Face distributions of embeddings of complete graphs
• scientific article; zbMATH DE number 4006288 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• Jungerman ladders and index 2 constructions for genus embeddings of dense regular graphs
• Minimal triangulations on orientable surfaces
• On the connectivity of graphs embedded in surfaces
• Orientable triangular embeddings of K\(_{18}\)-K\(_3\) and K\(_{13}\)-K\(_3\)
• Simultaneous current graph constructions for minimum triangulations and complete graph embeddings
• The connectivity of the dual

This page was built for publication: An optimal construction for complete graph embeddings with duals of low connectivity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6933605)