Gröbner Basis Convex Polytopes and Planar Graph

Abstract

Using the Gröbner basis of an ideal generated by a family of polynomials we prove that every planar graph is 4-colorable. Here we also use the fact that the complete graph of 5 vertices is not included in any planar graph.