Name
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. |
Year | Venue | Field |
|---|---|---|
2015 | CoRR | Discrete mathematics,Combinatorics,Vertex (geometry),Four color theorem,Planar triangulation,Planar,Time complexity,Mathematics |
DocType | Volume | Citations |
Journal | abs/1505.03962 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Martin Loebl | 1 | 152 | 28.66 |