Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45681
Title: ON COMPUTING A COMPLETE LIST OF IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANE
Authors: Vollmerhaus, W.
Thompson, D.J.
Keywords: Computer Science
Issue Date: 1-Dec-1980
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$.
URI: http://hdl.handle.net/1880/45681
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.