Invariants of almost embeddings of graphs in the plane

E. Alkin, A. Miroshnikov, A. Skopenkov

A graph drawing in the plane is called an almost embedding if the images of any two non-adjacent simplices (i.e. vertices or edges) are disjoint. Almost embeddings (more precisely,…