Embeddings of one kind of graphs

From MaRDI portal





The (non)orientable genus of the graph \(G\) is the least integer \(g\) such that \(G\) can be embedded on the (non)orientable surface of genus \(g\). The authors show that for any integers \(1\leq k\leq n\), where \(n\geq 3\), there exists a graph of orientable genus \(n\) and nonorientable genus \(k\).











This page was built for publication: Embeddings of one kind of graphs

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