4 citations · 6 across the 11 of their papers we have counts for
1 paper · 1 filter
Dang Vu Giang
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 ver…