A reduction of proposittional tautologihood to graph-coloring in three colors
Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VI, Tome 40 (1974), pp. 10-13
Cet article a éte moissonné depuis la source Math-Net.Ru
Given a disjunctive normal form $A$ of the length $l$ graph $\Gamma_A$ is constructed such that the number of $\Gamma_A$ is $c\cdot l$ and $\Gamma_A$ has a coloring of vert exes in three colors if and only if $A$ is not a tautology.
@article{ZNSL_1974_40_a2,
author = {G. V. Davydov and P. Yu. Suvorov},
title = {A~reduction of proposittional tautologihood to graph-coloring in three colors},
journal = {Zapiski Nauchnykh Seminarov POMI},
pages = {10--13},
year = {1974},
volume = {40},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a2/}
}
G. V. Davydov; P. Yu. Suvorov. A reduction of proposittional tautologihood to graph-coloring in three colors. Zapiski Nauchnykh Seminarov POMI, Studies in constructive mathematics and mathematical logic. Part VI, Tome 40 (1974), pp. 10-13. http://geodesic.mathdoc.fr/item/ZNSL_1974_40_a2/