Running summarizing tools on a new article
Check the paper below, then start its synthesis.
Deciding 4-colorability of planar triangulations
Martin Loebl
arXiv: 1505.03962v1 (math.CO)
License: NONEXCLUSIVE-DISTRIB 1.0
Abstract: We show, without using the Four Color Theorem, that for each planar triangulation, the number of its proper vertex colorings by 4 colors is a determinant and thus can be calculated in a polynomial time. In particular, we can efficiently decide if the number is non-zero.
Submitted to arXiv on 15 May. 2015