Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45682
Title: ON COMPUTING A SPECIAL CLASS OF IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANE
Authors: Vollmerhaus, Walter
Keywords: Computer Science
Issue Date: 1-Dec-1981
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].
URI: http://hdl.handle.net/1880/45682
Appears in Collections:Vollmerhaus, Walter

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.