Graph Embedding

[mburr at eecs.tufts.edu]

Hi,
     Does anyone know any work that has been done with isomorphisms of 
(nondegenerate) embeddings WITH crossings of complete graphs in the plane.  As 
an example, with 4 points there are two equivalence classes of embeddings, the 
four points arranged in a convex quadrilateral (so there is one crossing in 
the complete graph) or three of the points arranged in a triangle and the 
forth in the triangle's interior (there are no crossings in this case).  Thank 
you very much,
     Michael  



-------------------------------------------------
This mail sent through IMP: http://horde.org/imp/


-------------
The compgeom mailing lists: see
http://netlib.bell-labs.com/netlib/compgeom/readme.html
or send mail to compgeom-request at research.bell-labs.com with the line:
send readme
Now archived at http://www.uiuc.edu/~sariel/CG/compgeom/maillist.html.