2019/02/07 by Yoonah Lee, Lee, Yoonah
Computer Science · #Advanced Graph Theory Research #Combinatorics (math.CO) #Computational Geometry and Mesh Generation #Data Management and Algorithms #FOS: Mathematics
paper · pdf · doi:10.48550/arxiv.1902.02759
openalex publication_date 2019/02/07 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
The current state of knowledge of genus g orientable crossing numbers of complete graphs through K11 is reviewed. It is shown that cr3(K10)=3, cr3(K11)<=14, and cr4(K11)=4. It is established with the aid of an algorithm that there are precisely two non-isomorphic embeddings of K9 with a hexagon with all its vertices distinct on a surface of genus 3.