Computer Algorithms : B Please let me know if you need more time. Thank you in advance! Prove that the graph dual to Eulerian planar graph is bipartite. Solution A graph is planar if it has an embedding on the plane. A graph which has no embedding is non planar. Dual is a graph whose vertices are the regions of the drawing where two regions are adjacent if and only if they share a boundary – it is also a planar graph..