演講者：陳宏賓教授 

　　　　逢甲大學應用數學系

日　期：2017年4月12日（星期三） 14:30

地　點：國立高雄大學理學院408室

講　題： An Introduction to Online List Coloring on Graphs

摘　要：

The online list coloring problem is a turn-based strategy game on graphs with two players: Painter and Lister. Given a graph G, in each round, Lister first gives a list of vertices and Painter need to choose some vertices to paint under the requirement that no two adjacent vertices are painted in the same round. 

This is a more challenging generalization of the classical vertex coloring problem. In this talk, known results and something new will be introduced.