Embeddings of one kind of graphs
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\).
scientific article; zbMATH DE number 1078259