Research demonstrating that planar graphs without 4-cycles adjacent to triangles are DP-4-colourable has provided a valuable extension of previous list colouring results, thereby establishing ...

However, the main source of inspiration for planar graphs was the Four Color Conjecture (now Theorem; cf. Chapter 8) that the vertices of any planar graph can be colored with four colors in such a way ...