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

Thumbnail
Download
Download Record
Author
Vollmerhaus, Walter
Accessioned
2008-02-26T23:03:46Z
Available
2008-02-26T23:03:46Z
Computerscience
1999-05-27
Issued
1986-12-01
Subject
Computer Science
Type
unknown
Metadata
Show full item record

Abstract
No Abstract
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
Corporate
University of Calgary
Faculty
Science
Doi
http://dx.doi.org/10.11575/PRISM/31109
Uri
http://hdl.handle.net/1880/45688
Collections