PROVING THE COMPLETENESS OF A LIST OF 19 IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANE THAT CONTAIN 3,4
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].
Description
Keywords
Computer Science