Combinatorics Seminar

On r-hued coloring of graphs

Date: 3/23/2017
Time: 3:30PM-4:30PM
Place: 315 Armstrong Hall

Murong Xu

A (k,r)-coloring of a graph G is a proper k-vertex coloring of G such that the neighbors of each vertex of degree d will receive at least min{d,r} different colors. In this talk, the history of research on r-hued coloring of graphs will be introduced and some new results will be discussed.