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

Date
1983-12-01
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
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.
Description
Keywords
Computer Science
Citation
URI
http://hdl.handle.net/1880/45684
Collections
Science Research & Publications