科学研究

学术交流

首页 >  科学研究 >  学术交流 >  正文
Every planar graph without 5-cycles adjacent to 6-cycles is DP-4-colorable
作者:    时间:2019-01-07 浏览次数:

  

报告人: 李相文

工作单位: 华中师范大学

报告时间:20191814:30

报告地点:数学与统计学院南研究生教室

报告摘要:

DP-coloring of a graph was introduced by  Dvorak and Postle (2018) as a generalization of a list coloring. In the paper, we prove that every planar graph without 5-cycle adjacent to 6-cycle is DP-4-colorable, which is partially improved the results of  Kim and Ozeki who proved that for k\in \{3, 4, 5, 6\}, every planar graph without k-cycles is DP-4-colorable [Discrete Math., 341 (2018) 1983--1985].

报告人简介:

李相文,华中师范大学教授,博士生导师。研究方向为离散数学,组合数学和图论。美国西弗吉尼亚大学(West Virginia University)博士,加拿大里贾纳大学(University of Regina)博士后。先后主持多项国家自然基金,在J. Graph TheoryEuropean J. Combin等国际权威期刊发表论文七十余篇。