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

Simple item page
dc.contributor.authorVollmerhaus, Waltereng
dc.date.accessioned2008-02-26T23:03:28Z
dc.date.available2008-02-26T23:03:28Z
dc.date.computerscience1999-05-27eng
dc.date.issued1983-12-01eng
dc.description.abstractIn 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.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.department1983-142-31eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/31108
dc.identifier.urihttp://hdl.handle.net/1880/45684
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleON COMPUTING ALL IRREDUCIBLE NON-EMBEDDABLE GRAPHS FOR THE PROJECTIVE PLANE THAT CONTAIN K sub 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