In this paper we design an algorithm based on branch and bound
rules embedded in a multistage scheme which allows
iterative visits of subgraphs.
The algorithm is conceived to finding lower bounds
of the chromatic number of graphs, and, by means of
simple coloring extension rules, it is often capable
of finding optimal solutions. Computational results
on benchmarks are provided.
