Abstract: In
this paper, we work on a graph in based
on a eucledian meter called the Delaunay graph. This graph has many applications
in the area of computer science and neural networks. In
addition, we introduce a 3-coloring algorithm for this graph whose time
complexity is
Keywords and phrases: planer graph, 3-coloring, Voronoi polygone.
