报告方式：线上报告，腾讯会议号933 279 965
邀请人：常虹
摘要：
Generalized Petersen graphs, denoted by GP(n,k), form an important class of highly symmetric 3-connected cubic graphs. The problem of existence of Hamiltonian cycles in GP(n,k) has been studied for a long time and thoroughly settled. Inspired by Bondy's meta-conjecture that almost every nontrivial condition for Hamiltonicity also implies pancyclicity, we try to figure out the possible lengths of cycles in GP(n,k). For k∈{2,3}, we completely determine all possible cycle lengths in GP(n,k). We also prove that, when k is odd, and n is even and sufficiently large, GP(n,k) is bipartite and weakly even pancyclic.
简介：
张赞波现为广东财经大学统计与数学*女王调教-女王调教视频-女王 调教小说教授。他先后在中山大学和荷兰特文特大学（University of Twente）获得计算机和应用数学方向博士学位，2014-2018年为广东省“千百十”人才培养工程省级培养对象，主要从事图论及其算法等方面研究工作。他在SIAM J. on Discrete Mathematics，J. of Graph Theory等著名国际学术期刊上发表论文二十多篇，完成英文学术著作两本，在图的匹配理论，路圈理论，图划分算法和连通度算法等方向上取得系列成果，部分被相关领域的专著和综述所引用。他主持完成广东省自然科学基金项目两项，现主持广东省重点科研项目一项。
(详见//shx.gdufe.edu.cn/2021/0326/c6533a127013/page.htm)