A Non-Conventional Coloring of the Edges of a Graph
Sándor Szabó · Open Journal of Discrete Mathematics · 2012
Coloring the nodes of a graph is a commonly used technique to speed up clique search algorithms. Coloring the edges of the graph as a preconditioning method can also be used to speed up computations. In this paper we will show that an unconventional coloring scheme of the edges leads to an NP-complete problem when one intends to determine the optimal number of colors.