Gröbner Basis Convex Polytopes and Planar Graph

Details Gröbner Basis Convex Polytopes and Planar Graph Gröbner Basis Convex Polytopes and Planar Graph

2012-02-21

arxiv.org/abs/1202.4510v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Gröbner Basis Convex Polytopes and Planar Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Gröbner Basis Convex Polytopes and Planar Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Gröbner Basis Convex Polytopes and Planar Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-422413