Articles by Qiancheng Ouyang

Proper vertex coloring with odd occurence - Probabilistic approach

-- Qiancheng Ouyang (LISN)

summary: In graph theory, a graph coloring is an assignment of colors to elements of a graph subject to certain constraints. A vertex coloring is said to be proper if any pair of two adjacent vertices are assigned distinct colors. For a graph G, the chromatic number χ(G) is ...