1. Every planar map is four colorable;Appel;Bull. Amer. Math. Soc.,1976
2. Graph Theory;Bondy,2008
3. Thirteen colouring numbers for outerplane graphs;Borodin;Bul. Inst. Combin. and Appl.,1995
4. Optimal strong parity edge-colouring of complete graphs;Bunde;Combinatorica,2008
5. Parity and strong parity edge-colouring of graphs;Bunde;Congressus numerantium,2007