The relative maximum genus of a graph (Q1322015): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1006/jctb.1994.1013 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1006/JCTB.1994.1013 / rank | |||
Normal rank | |||
Latest revision as of 18:05, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The relative maximum genus of a graph |
scientific article |
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
