Title: | Circular coloring of graphs |
Speaker: | Prof. Zhu Xuding, National Sun Yat Sen University, Taiwan |
Time/Place: | 11:30 - 12:30 FSC1217, Fong Shu Chuen Library, HSH Campus, Hong Kong Baptist University |
Abstract: | A graph is used as a model for resource distribution problems, where vertices represent consumers and edges represent pairs of consumers with conflicts. The goal is to assign a point on a circle to each vertex of the graph so that pairs of vertices connected by edges are far apart from each other. Such an assignment is called a circular coloring of the graph. It is a refinement of the vertex coloring of graphs, and is particularly suitable for modeling periodic scheduling problems. The concept has been studied extensively in the past twenty years. In this talk, I shall survey results and some of the methods used in the study of problems in this area. |
We organize conferences and workshops every year. Hope we can see you in future.
Learn MoreProf. M. Cheng, Dr. Y. S. Hon, Dr. K. F. Lam, Prof. L. Ling, Dr. T. Tong and Prof. L. Zhu have been awarded research grants by Hong Kong Research Grant Council (RGC) — congratulations!
Learn MoreFollow HKBU Math