Graph coloring has been employed since the 1980s to efficiently compute sparse Jacobian and Hessian matrices using either finite differences or automatic differentiation. Several coloring problems ...

For graph coloring, we report on three simulated annealing schemes, all of which can dominate traditional techniques for certain types of graphs, at least when large amounts of computing time are ...

Graph Coloring and Planar Graphs Publication Trend The graph below shows the total number of publications each year in Graph Coloring and Planar Graphs.