The relative maximum genus of a graph (Q1322015)
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 562403
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The relative maximum genus of a graph |
scientific article; zbMATH DE number 562403 |
Statements
The relative maximum genus of a graph (English)
0 references
5 May 1994
0 references
A relative embedding of a graph in a surface with respect to a set of closed walks is one where each of the prescribed closed walks bounds a face of the embedding. In the special case where the set of closed walks is empty, this amounts to the usual concept of a graph embedding. We present a formula for the maximum (orientable) genus of the surface on which a graph has a relative embedding with respect to a set of closed walks.
0 references
embedding
0 references
surface
0 references
closed walks
0 references
genus
0 references
0.94265615940094
0 references
0.8818007707595825
0 references
0.8656795024871826
0 references
