数学研究所学术报告(杨燕平副教授,宁波财经学院;刘娟副教授,江西科技师范大学)
来源:系统管理员 发布时间:2026-11-20
报告题目1:List vertex arboricity of planar graphs without choral 6 cycles
报告人:杨燕平副教授,宁波财经学院
报告时间:2026年11月24日(周二)18:30-19:50
报告地点:腾讯会议:510-104-350
报告摘要:The vertex arboricity a(G) of a graph G is the minimum number of colors required to color the vertices of G such that no cycle is monochromatic. The list vertex arboricity al(G) is the list version of this concept. In this paper, we prove that if G is a planar graph without choral 6, then al(G)≤ 2.
报告人简介:杨燕平,宁波财经学院副教授,理学博士,研究方向:运筹学与控制论,长期从事数学及相关领域的科学研究工作。主持浙江省哲学社会科学规划项目1项、省一流课程建设1项,参与省级课题3项,已在《Discrete Mathematics》《Applied Mathematics and Computation》和《Advancesin Mathematics (china)》发表论文5篇,曾到中国香港浸会大学访问学习。
报告题目2:Decomposing 1-planar graphs into three forests and a linear forest
报告人:刘娟副教授,江西科技师范大学
报告时间:2026年11月24日(周二)19:50-21:20
报告地点:腾讯会议:510-104-350
报告摘要:We prove that the edge set of every finite simple 1-planar graph can be partitioned into three forests and a linear forest. The bound of two on the maximum degree of the distinguished forest is best possible. A 1-planar graph with twelve vertices and forty edges admits no partition into three forests and a matching. A key step shows that every simple 2-connected plane graph whose faces have length three or four and which has at least one triangular face contains a spanning Laman subgraph. An acyclic vertex–face incidence selection and a rooted gluing argument then yield the decomposition.
报告人简介:刘娟,江西科技师范大学副教授,理学博士。主持国家自然科学基金项目2项、江西省自然科学基金项目1项、江西省教育厅科技项目1项、江西科技师范大学青年拔尖人才1项,参与国家自然科学基金项目2项。其研究成果发表于《Journal of Graph Theory》《Discrete Applied Mathematics》《Discrete Mathematics》《Acta Mathematica Sinica, English Series》等国内外知名期刊上。
邀请人:数学研究所

