ON COMPUTING A COMPLETE LIST OF IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANE

Simple item page
dc.contributor.authorVollmerhaus, W.eng
dc.contributor.authorThompson, D.J.eng
dc.date.accessioned2008-02-26T23:03:13Z
dc.date.available2008-02-26T23:03:13Z
dc.date.computerscience1999-05-27eng
dc.date.issued1980-12-01eng
dc.description.abstractThis paper presents some initial work done in establishing a complete list of irreducible non-embeddable graphs for the projective plane. The main result presented is the following theorem: All irreducible non-embeddable graphs for the projective plane which have a subgraph contractable to $GAMMA sub 1$ and do not have a subgraph contractable to $K sub 3,4$, are contractable to one of four graphs listed in the set $S sub 2$.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.department1980-48-6eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/31107
dc.identifier.urihttp://hdl.handle.net/1880/45681
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleON COMPUTING A COMPLETE LIST OF IRREDUCIBLE NON-EMBEDDABLE GRAPHSFOR THE PROJECTIVE PLANEeng
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