报告题目1：The neighbor-distinguishing edge coloring of graphs

报告人：霍京京教授，河北工程大学

报告时间：2026年10月20日（周二）18:30-19:30

报告地点：腾讯会议：990-254-187

报告摘要：A proper edge k-coloring of a graph G is a mapping  
such that no two adjacent edges receive same color. Given a proper edge k-coloring
of G and a vertex
, we use
to denote the set of colors assigned to those edges incident with v. The proper edge k-coloring
of G is called neighbor-distinguishing if
for each edge
. The neighbor-distinguishing chromatic index  of G is the smallest positive integer k such that G has a neighbor-distinguishing k-edge coloring. In this talk, I will give a brief presentation on the development of this direction and report some new results.

报告人简介：霍京京，博士，河北工程大学教授，硕士生导师，美国数学会《数学评论》评论员，河北省燕赵英才，河北省运筹学会理事，邯郸市经济学会副会长。2017年于苏州大学运筹学与控制论专业获理学博士学位，主要研究方向为图的染色与标号，主持完成国家自然科学基金青年项目和河北省自然科学基金面上项目各1项，参与完成国家级、省级自然科学基金项目3项，在国内外重要刊物上发表学术论文20余篇。

报告题目2：Acyclic Colorings of 1-planar Graphs

报告人：杨万顺副教授，潍坊学院

报告时间：2026年10月20日（周二）19:30-20:30

报告地点：腾讯会议：990-254-187

报告摘要：An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index   
of G is the smallest k such that G has an acyclic edge coloring using k colors. A graph is called 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. In this talk, we discuss the acyclic vertex coloring and acyclic edge coloring of graphs. In particular, we show that every 1-planar graph G with maximum degree∆ has
.

报告人简介：杨万顺，潍坊学院副教授。主要研究图的结构分析与染色问题，重点关注IC-平面图、1-平面图无圈染色，主持山东省自然科学基金面上项目1项，参与2项国家自然科学基金项目，在国内外学术期刊上发表学术论文6篇。

邀请人：数学研究所