Non-orientable genus of a graph

asked 2015-04-10 20:58:53 +0200

JEFLSU gravatar image

I'm doing some research on crossing-criticality of graphs on surfaces, and am looking for an algorithm to test non-orientable genus. Of course, for orientable surfaces Sage already has an algorithm built in, and I can test for non-projective minors for the projective plane, but does anyone know of work being done on implementation of non-orientable genus testing of a graph?

edit retag flag offensive close merge delete