ON COMPUTING A COMPLETE LIST OF IRREDUCIBLE NON-EMBEDDABLE
GRAPHSFOR THE PROJECTIVE PLANE

Vollmerhaus, W.; Thompson, D.J.

ON COMPUTING A COMPLETE LIST OF IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANE

Date

1980-12-01

Authors

Vollmerhaus, W.

Thompson, D.J.

Abstract

This paper presents some initial work done in establishing a complete list of irreducible non-embeddable graphs for the projective plane. The main result presented is the following theorem: All irreducible non-embeddable graphs for the projective plane which have a subgraph contractable to $G A M M A s u b 1$ and do not have a subgraph contractable to $K s u b 3,4$ , are contractable to one of four graphs listed in the set $S s u b 2$ .