ON COMPUTING A SPECIAL CLASS OF IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANE

Date
1981-12-01
Journal Title
Journal ISSN
Volume Title
Publisher
Abstract
This paper is a continuation of [1], presenting some more results leading to establishing a complete list of irreducible non-embeddable graphs for the projective plane. The main result presented here is the following theorem: All irreducible non-embeddable graphs for the projective plane which have a subgraph contractable to $E sub 1$ and do not have a subgraph contractable to $GAMMA sub 1$ or $K sub 3,4$, are contractable to the graph $F sub 10$ in [2].
Description
Keywords
Computer Science
Citation