中文版 英文版
 
   
 
  首 页 中心概况 新闻动态 学术活动 交流合作
 
 
 当前位置:首页 -> 学术活动 -> 学术报告
 
名 称 研究生教育创新计划GAP研讨班系列讲座之七十一【朱绪鼎】
题 目 Online list colouring of graphs
报告人
时 间 0000-00-00
地 点
详 细

 

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

时间:3月18号(周五)4:00-5:30

地点:管研楼1611

摘要: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.

欢迎广大师生参加!

 
 
  欢迎访问中国科学院国家数学与交叉科学中心(合肥)
地址:合肥金寨路96号中国科技大学数学科学学院 邮编:230026 电话: 0551-3600206 Fax: 0551-3601005 邮箱: ncmis@ustc.edu.cn