We consider eight variant vertex coloring problems here. This article begins with a gentle introduction to the problem of computing a sparse Jacobian, followed by an overview of the historical ...

Sandi Klavžar, COLORING SIERPIŃSKI GRAPHS AND SIERPIŃSKI GASKET GRAPHS, Taiwanese Journal of Mathematics, Vol. 12, No. 2 (April 2008), pp. 513-522 ...

Conflict-Free Coloring in Graphs and Hypergraphs Publication Trend The graph below shows the total number of publications each year in Conflict-Free Coloring in Graphs and Hypergraphs.

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

A theorem for coloring a large class of “perfect” mathematical networks could ease the way for a long-sought general coloring proof.