ON COMPUTING A SPECIAL CLASS OF IRREDUCIBLE NON-EMBEDDED GRAPHS FOR THE PROJECTIVE PLANE II

Simple item page
dc.contributor.authorVollmerhaus, Waltereng
dc.date.accessioned2008-02-26T23:03:23Z
dc.date.available2008-02-26T23:03:23Z
dc.date.computerscience1999-05-27eng
dc.date.issued1982-12-01eng
dc.description.abstractThis paper is a continuation of [2], presenting some more results leading to establishing a complete list of irreducible non-embeddable graphs for the projective plane. The main result presented here is the following theorem: all irreducible non-embeddable graphs for the projective plane which have a subgraph contractable to $E sub 2$ and do not have a subgraph contractable to $E sub 1$ or $GAMMA sub 1$ or $K sub 3,4$ are contractable to one of the 3 graphs $F sub 3, F sub 4$ or $E sub 20$ in [E].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.department1982-109-28eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/31111
dc.identifier.urihttp://hdl.handle.net/1880/45683
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleON COMPUTING A SPECIAL CLASS OF IRREDUCIBLE NON-EMBEDDED GRAPHS FOR THE PROJECTIVE PLANE IIeng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.86 KB
Format:
Plain Text
Description:
Download
Collections
Science Research & Publications