ON COMPUTING ALL IRREDUCIBLE NON-EMBEDDABLE GRAPHS FOR THE PROJECTIVE PLANE THAT CONTAIN K sub 3,4

Vollmerhaus, Walter2008-02-262008-02-261983-12-01http://hdl.handle.net/1880/45684In 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.EngComputer ScienceON COMPUTING ALL IRREDUCIBLE NON-EMBEDDABLE GRAPHS FOR THE PROJECTIVE PLANE THAT CONTAIN K sub 3,4unknown1983-142-31http://dx.doi.org/10.11575/PRISM/31108