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

Date
1980-12-01
Journal Title
Journal ISSN
Volume Title
Publisher
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 $GAMMA sub 1$ and do not have a subgraph contractable to $K sub 3,4$, are contractable to one of four graphs listed in the set $S sub 2$.
Description
Keywords
Computer Science
Citation