Two maps on one surface

From MaRDI portal





The authors consider simultaneous embeddings of two graphs on a surface. The problem is to find equivalent embeddings of the two given embeddings such that the total number of edge crossings is minimum. (No two edges in the same graph cross.) For the projective plane the problem is solved completely: The minimum number of crossings is the product of the lengths of the shortest noncontractible cycles in the dual graphs. Upper and lower bounds in the torus case are also presented, and the general case is briefly discussed.











This page was built for publication: Two maps on one surface

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2725321)