All Title Author
Keywords Abstract

Mathematics  2012 

Gr?bner Basis Convex Polytopes and Planar Graph

Full-Text   Cite this paper   Add to My Lib


Using the Gr\"obner 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.


comments powered by Disqus