On cubic graphs which are irreducible for nonorientable surfaces (Q1066151): Difference between revisions
From MaRDI portal
Latest revision as of 11:04, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On cubic graphs which are irreducible for nonorientable surfaces |
scientific article |
Statements
On cubic graphs which are irreducible for nonorientable surfaces (English)
0 references
1985
0 references
A graph G is irreducible for a surface S if G does not embed in S but any proper subgraph of G does embed in S. The authors prove that the set of cubic irreducible graphs for a nonorientable surface of nonorientable genus n is finite for each n.
0 references
graph embedding
0 references
cubic irreducible graphs
0 references
nonorientable surface
0 references
