On cubic graphs which are irreducible for nonorientable surfaces
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.
scientific article; zbMATH DE number 3924799