数学科学系

Department of Mathematical Sciences

Adjacent Vertex Distinguishing Colorings of Graphs

报告题目:Adjacent Vertex Distinguishing Colorings of Graphs

 

报告人:王维凡教授(浙江师范大学)

 

时间:20141212日(星期五)15:00--16:00

 

地点:理科楼数学系B203

 

摘要: An adjacent vertex distinguishing edge k-coloring of a graph G is a proper edge k-coloring f of G such that for any two adjacent vertices u and v have C(u) = C(v), where C(x) denotes a set of colors used on the edges incident to a vertex x. The adjacent vertex distinguishing edge chromatic number $\chi­′_a(G)$ of G is the smallest k for which G admits an adjacent vertex distinguishing edge k-coloring. Similarly, we can define the adjacent vertex distinguishing total chromatic number $\chi'­'_a(G)$ of a graph G. In this talk we study the adjacent vertex distinguishing edge coloring and total coloring of some graphs such as outerplanar graphs, $K_4$-minor free graphs, planar graphs, graphs with lower maximum average degree, etc. We give a chief survey on this direction.

 

报告人简介:王维凡,博士,博士生导师,浙江师范大学特聘教授。19987月于南京大学获得博士学位,19991月至200012月在台湾中央研究院数学研究所从事博士后研究。主要研究领域为图论与网络优化,特别感兴趣的分支是图的染色与标号、连通性、边分解、存活率、网络可靠性等。主持国家自然科学基金7项,浙江省自然科学基金2项(其中重点1项),科技部中法先进研究计划项目1项。在《J. Combin. Theory Ser. B》、《SIAM. J. Discrete Math.》、《J. Graph Theory》、《European J. Combin.》、《中国科学》等国内外学术刊物上发表论文150余篇,其中被SCI检索120余篇。获浙江省自然科学学术奖一等奖1项、浙江省科学技术奖二等奖1项、浙江省高校科研成果奖二等奖1项。现任中国数学会理事、中国工业与应用数学会理事、中国组合数学与图论学会常务理事、浙江省数学会副理事长、浙江师范大学数学研究所执行所长、数学一级学科博士点负责人。

 

联系人:陆玫