We describe graph coloring instances arising in numerical estimation of
mathematical derivatives. The coloring
instances are obtained from a matrix partitioning problem.
The size of the generated graphs
is dependent on the number of segmented columns which can be varied
between the number of columns and the number of nonzeros
in the associated matrix.