Darko writes: ------------ here is the stuff. i doublechecked the program for memory leaks and simplified the parameter structure. color.cpp and color.h contain the graph definitions and coloring procedure. main.cpp is a simple test procedure. 250.in is a typical test example. to run the program just go: main.exe 250.in graph description format cardinalities: p #nodes #edges edge connecting node #node1 and #node2: e #node1 #node2 node enumeration starts from 1. edge replication at input may result in unknown problems. We give no guarantees that the program works correctly nor that it does not induce side effects that may cause loss or alteration of data stored in any possible way on any computer. We take no responsibility for any action caused by using copying or installing this program. Technical support is always available at: darko@cs.ucla.edu good luck, Darko ===================================== To compile with g++ compiler, type g++ -O3 -o gc color.cpp main.cpp gc 250.in