1. Every planar map is four colorable;Appel;Contemp. Math.,1989
2. Graph Theory;Bondy,2008
3. Solution of Ringel’s problems on vertex-face coloring of plane graphs and coloring of 1-planar graphs;Borodin;Met. Diskret. Anal.,1984
4. Optimal strong parity edge-coloring of complete graphs;Bunde;Combinatorica,2008
5. Parity and strong parity edge-coloring of graphs;Bunde;Congr. Numer.,2007