Embeddings of one kind of graphs (Q1370294)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1078259
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Embeddings of one kind of graphs |
scientific article; zbMATH DE number 1078259 |
Statements
Embeddings of one kind of graphs (English)
0 references
26 October 1997
0 references
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\).
0 references
graph embedding
0 references
genus
0 references
surface
0 references
0.8348550200462341
0 references
0.8169967532157898
0 references
0.8143582940101624
0 references
0.8131938576698303
0 references
