PROVING THE COMPLETENESS OF A LIST OF 19 IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANE THAT CONTAIN 3,4

Simple item page
dc.contributor.authorVollmerhaus, Waltereng
dc.date.accessioned2008-02-26T23:03:32Z
dc.date.available2008-02-26T23:03:32Z
dc.date.computerscience1999-05-27eng
dc.date.issued1984-12-01eng
dc.description.abstractIn 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].eng
dc.description.notesWe are currently acquiring citations for the work deposited into this collection. We recognize the distribution rights of this item may have been assigned to another entity, other than the author(s) of the work.If you can provide the citation for this work or you think you own the distribution rights to this work please contact the Institutional Repository Administrator at digitize@ucalgary.caeng
dc.identifier.department1984-177-35eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/31112
dc.identifier.urihttp://hdl.handle.net/1880/45685
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titlePROVING THE COMPLETENESS OF A LIST OF 19 IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANE THAT CONTAIN 3,4eng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications