Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45685
Title: PROVING THE COMPLETENESS OF A LIST OF 19 IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANE THAT CONTAIN 3,4
Authors: Vollmerhaus, Walter
Keywords: Computer Science
Issue Date: 1-Dec-1984
Abstract: In this paper we show that the list A sub 2 , B sub 1 , B sub 7 , C sub 3 , C sub 4 , C sub 7 , D sub 2 , D sub 3 , D sub 9 , D sub 12 , D sub 17 , E sub 2 , E sub 3 , E sub 5, E sub 11 , E sub 18 , E sub 19 , E sub 27 , G is the complete list of all 3-connected irreducible graphs that cannot be embedded into the projective plane and that contain {K sub 3,4} as a minor. The graphs are named as in [1].
URI: http://hdl.handle.net/1880/45685
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.