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

Vollmerhaus, Walter2008-02-262008-02-261986-12-01http://hdl.handle.net/1880/45688No AbstractEngComputer ScienceON COMPUTING ALL MINIMAL GRAPHS THAT ARE NOT EMBEDDABLE INTO THE PROJECTIVE PLANEPART 1unknown1986-252-2610.11575/PRISM/31109