ON COMPUTING A SPECIAL CLASS OF IRREDUCIBLE NON-EMBEDDED GRAPHS FOR THE PROJECTIVE PLANE II
dc.contributor.author | Vollmerhaus, Walter | eng |
dc.date.accessioned | 2008-02-26T23:03:23Z | |
dc.date.available | 2008-02-26T23:03:23Z | |
dc.date.computerscience | 1999-05-27 | eng |
dc.date.issued | 1982-12-01 | eng |
dc.description.abstract | This 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.notes | We 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.ca | eng |
dc.identifier.department | 1982-109-28 | eng |
dc.identifier.doi | http://dx.doi.org/10.11575/PRISM/31111 | |
dc.identifier.uri | http://hdl.handle.net/1880/45683 | |
dc.language.iso | Eng | eng |
dc.publisher.corporate | University of Calgary | eng |
dc.publisher.faculty | Science | eng |
dc.subject | Computer Science | eng |
dc.title | ON COMPUTING A SPECIAL CLASS OF IRREDUCIBLE NON-EMBEDDED GRAPHS FOR THE PROJECTIVE PLANE II | eng |
dc.type | unknown | |
thesis.degree.discipline | Computer Science | eng |
Files
License bundle
1 - 1 of 1