A relative maximum genus graph embedding and its local maximum genus (Q1594860): Difference between revisions
From MaRDI portal
Latest revision as of 11:42, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A relative maximum genus graph embedding and its local maximum genus |
scientific article |
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
