Theorem 5.31 Every planar graph with no loop is 4-colourable if and only if its dual is 4-region colourable▪ Theorem 5.31 Every planar graph with no loop is 4-colourable if and only if its dual is 4-region colourable