scientific article; zbMATH DE number 1789783

From MaRDI portal
Publication:4549088





The genus distribution of a connected graph \(G\) is a sequence \(g_0,g_1,\dots,g_i,\dots\) such that \(g_i\) is the number of different \(2\)-cell embeddings of \(G\) in the orientable surface of genus \(i\). Two embeddings are defined to be different if the corresponding rotations are distinct. By using the idea of semirelative embeddings (those where parts of face boundaries are predetermined) the author derives the genus distribution of the circular ladder graph---the Cartesian product of the \(n\)-cycle with the complete graph of order \(2\).











This page was built for publication:

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