On cubic graphs which are irreducible for nonorientable surfaces (Q1066151)

From MaRDI portal
Revision as of 02:04, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    0 references
    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

    Identifiers