1. Alizadeh, F.: Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J. Optim. 5, 13–51 (1995)
2. Appel, K., Haken, W.: Every planar map is four colorable. part I: discharging. Ill. J. Math. 21, 429–490 (1977)
3. Appel, K., Haken, W., Koch, J.: Every planar map is four colorable. part II: reducibility. Ill. J. Math. 21, 491–567 (1977)
4. Brinkmann, G., McKay, B.D.: Fast generation of planar graphs. MATCH- Commun. Math. Comput. Chem. 58, 323–357 (2007)
5. Colin de Verdière, Y.: Sur un nouvel invariant des graphes et un critére de planarité. J. Combin. Theory Ser. B 50, 11–21 (1990)