题目： Online list colouring of graphs

报告人：朱绪鼎 浙江师范大学

时间：3月18号（周五）4:00-5：30

地点：管研楼1218

摘要：List colouring of graphs is a resource distribution problem: The colours are resources, and vertices of a graph represent consumer of these resources, and the lists gives the information which colours (resources) are available to each vertex (consumer). The edges of the graph represents conflicts between consumers sharing a same resource.List colouring of graphs deals with the problem of how to assign colours to vertices that avoids the conflicts. Online list colouring of graphs deals with the problem when the availability of the colours to the vertices is revealed online and the distribution needs to be given online.In this talk, I shall survey some results, open problems in this area and explain some methods used in the study of online list colouring of graphs.

欢迎广大师生参加！