Please use this identifier to cite or link to this item: http://hdl.handle.net/1880/45688
Title: ON COMPUTING ALL MINIMAL GRAPHS THAT ARE NOT EMBEDDABLE INTO THE PROJECTIVE PLANEPART 1
Authors: Vollmerhaus, Walter
Keywords: Computer Science
Issue Date: 1-Dec-1986
Abstract: No Abstract
URI: http://hdl.handle.net/1880/45688
Appears in Collections:Vollmerhaus, Walter

Files in This Item:
File Description SizeFormat 
1986-252-26.pdf3.12 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.