报告题目1：Rich-neighboredge-coloringsofgraphs

报告人：孔将旭副教授，杭州师范大学

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

报告地点：腾讯会议：821-169-828

报告摘要：An edge in a proper edge-coloring is called rich if all edges adjacent to it receive pairwise distinct colors. A rich-neighbor edge-coloring is a proper edge-coloring in which every non-isolated edge is adjacent to a rich edge. This notion is a natural relaxation of strong edge-coloring. The minimum number of colors needed for such acoloring is the rich-neighbor chromatic index, denoted by .

This talk presents recent results on rich-neighbor edge-colorings. We establish the bound  for every loopless multigraph G, yielding the linear upper bound  for simple graphs. We also determine exact values for several classical graph families and verify the conjectured five-color bound for various classes of subcubic graphs.

报告人简介：孔将旭，杭州师范大学副教授、硕士生导师。主要从事图论与组合优化研究，重点关注图的结构与染色、图的存活率及网络优化等问题。2015年于厦门大学获理学博士学位，博士期间于2014年8月至2015年8月赴美国西弗吉尼亚大学联合培养。2020年6月至2022年12月在浙江师范大学从事博士后研究工作。主持完成国家自然科学基金青年基金（C类）、数学天元基金、中国博士后科学基金面上项目和浙江省自然科学基金青年项目各1项。在Journal of Graph Theory、Discrete Mathematics、Discrete Applied Mathematics等学术期刊发表论文30余篇。

报告题目2：Strict neighbor-distinguishing index of planar graphs without 4-cycles

报告人：井普宁博士，徐州工程学院

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

报告地点：腾讯会议：821-169-828

报告摘要：A proper edge coloring of a graph G is strict neighbor-distinguishing if for any two adjacent vertices u and v, the set of colors used on the edges incident to u and the set of colors used on the edges incident to v are not included with each other. The strict neighbor-distinguishing index of G is the minimum number  
of colors in a strict neighbor-distinguishing edge coloring of G. It was conjectured that every simple graph G without leaves has 
except a special graph . In this paper, we show that if G is a planar graph without 4-cycles, then
.

报告人简介：井普宁，博士，徐州工程学院数学与统计学院教师。主要从事图的结构参数与染色问题研究，相关研究成果发表于《中国科学：数学》，DiscreteAppl.Math.,Czechoslovak Math. J.等国内外知名期刊。

邀请人：数学研究所