In this article we show that any embedded graph has a checkerboard colourable twual,which is equivalent to having a bipartite twual.We also obtain that any Eulerian embedded graph has a checkerboard colourable partial Petrial,answering questions posed by Ellis-Monaghan and Moffatt[Trans.Amer.Math.Soc.,364,1529-1569 (2012)].