报告题目：Channel assignment problem and t-relaxed 2-distant coloring of graphs
报告人：
时间：2018-11-09 23:07
地点：报告人：林文松工作单位：东南大学报告时间：2018年11月10日18:00报告地点：数学与统计学院一楼报告厅报告摘要：Let G be a simple graph. Suppose f is a mapping from V (G) to nonnegative integers. If, for any two adjacent vertices u and v of G, |f(u)−f(v)|≥ 2, then f is called a 2-distant coloring of G. In this paper, we introduce a relaxation of 2-distant coloring of a graph. Let t be a nonnegative ...
