A relative maximum genus graph embedding and its local maximum genus (Q1594860)
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 1558286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A relative maximum genus graph embedding and its local maximum genus |
scientific article; zbMATH DE number 1558286 |
Statements
A relative maximum genus graph embedding and its local maximum genus (English)
0 references
28 November 2001
0 references
The relative maximum genus (with respect to a given set \(W\) of closed walks) of a connected graph is the largest genus of an orientable surface into which the graph embeds cellularly in such a way that each closed walk in \(W\) bounds a face. Under certain restrictions the authors provide a polynomial time algorithm to determine the relative maximum genus.
0 references
relative embedding
0 references
relative maximum genus
0 references
algorithm
0 references
0.8595049977302551
0 references
0.8595045208930969
0 references
0.8335487246513367
0 references
0.8265989422798157
0 references
