Journal of Algebra, Number Theory: Advances and ApplicationsAuthor's: Giuseppe Trigiante and Donato Trigiante
Pages: [1] - [28]
Received Date: July 30, 2008
Submitted by:
It is well known that the problem of planar graph colorability is strictly related to the famous four color problem. In this novel approach a color set called spectrum is assigned progressively to each point of the graph being constructed. The limitations on spectrum are due to various kinds of chaining processes. Two of them are deeply analyzed showing that they do not prevent the colorability. A conjecture claiming that such chains are the only possible is, then formulated. Should such conjecture be true, the approach could be considered a proof of the four color theorem.
graph coloring, four color problem.
