On Genus g Orientable Crossing Numbers of Small Complete Graphs
From MaRDI portal
Abstract: 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.
This page was built for publication: On Genus g Orientable Crossing Numbers of Small Complete Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6313762)
