Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45684
Title: ON COMPUTING ALL IRREDUCIBLE NON-EMBEDDABLE GRAPHS FOR THE PROJECTIVE PLANE THAT CONTAIN K sub 3,4
Authors: Vollmerhaus, Walter
Keywords: Computer Science
Issue Date: 1-Dec-1983
Abstract: In this paper we compute a complete list of all 3-connected irreducible graphs containing a subgraph contractable to K sub 3,4 that are not embeddable into the projective plane.
URI: http://hdl.handle.net/1880/45684
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.