On cubic graphs which are irreducible for nonorientable surfaces (Q1066151): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Additivity of the genus of a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Graphs with bounded valency that do not embed in the projective plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: 103 graphs that are irreducible for the projective plane / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4187845 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Irreducible graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Blocks and the nonorientable genus of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Generalized Embedding Schemes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3847965 / rank | |||
Normal rank | |||
Revision as of 18:26, 14 June 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
