欢迎光临!
您现在所在的位置:首页 >> 通知公告 & 学术信息
学术信息
SEMINARS
Adjacent Vertex Distinguishing Colorings of Graphs
时间  Datetime
2018-12-09 10:00 — 11:00 
地点  Venue
Middle Lecture Room
报告人  Speaker
Weifan Wang(王维凡)
单位  Affiliation
Department of Mathematics,Zhejiang Normal University
邀请人  Host
马俊
报告摘要  Abstract

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 χ ′ 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 χ ′′ a (G) of a graph G. In this talk, we investigate the adjacent vertex distinguishing edge coloring and total coloring of general graphs, planar graphs, graphs with lower maximum average degree, etc. We give a detailed survey on this topic.