Gr\"obner Basis Convex Polytopes and Planar Graph
General Mathematics
2012-06-11 v1
Abstract
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.
Cite
@article{arxiv.1202.4510,
title = {Gr\"obner Basis Convex Polytopes and Planar Graph},
author = {Dang Vu Giang},
journal= {arXiv preprint arXiv:1202.4510},
year = {2012}
}