ON COMPUTING ALL MINIMAL GRAPHS THAT ARE NOT EMBEDDABLE INTO THE PROJECTIVE PLANEPART 1

Simple item page
dc.contributor.authorVollmerhaus, Waltereng
dc.date.accessioned2008-02-26T23:03:46Z
dc.date.available2008-02-26T23:03:46Z
dc.date.computerscience1999-05-27eng
dc.date.issued1986-12-01eng
dc.description.abstractNo Abstracteng
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.department1986-252-26eng
dc.identifier.doihttp://dx.doi.org/10.11575/PRISM/31109
dc.identifier.urihttp://hdl.handle.net/1880/45688
dc.language.isoEngeng
dc.publisher.corporateUniversity of Calgaryeng
dc.publisher.facultyScienceeng
dc.subjectComputer Scienceeng
dc.titleON COMPUTING ALL MINIMAL GRAPHS THAT ARE NOT EMBEDDABLE INTO THE PROJECTIVE PLANEPART 1eng
dc.typeunknown
thesis.degree.disciplineComputer Scienceeng
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
1986-252-26.pdf
Size:
3.05 MB
Format:
Adobe Portable Document Format
Download
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