报告方式：线上报告，腾讯会议(ID: 341 167707,密码: 1121)
邀请人：常虹博士
摘要：
In this talk, we shall present some results to show what happens when we add a necessary condition. For example, being 2-connected is a necessary for a graph to be hamiltonian. We know some classic results on this topic:Ore condition and Dirac condition,and so on. We focus on forbidden subgraphs conditions to guarantee a graph to have hamiltonian property. In fact,we may consider any other property.
简介：
熊黎明,荷兰Twente大学博士,现为北京理工大学数学与统计*女王调教-女王调教视频-女王 调教小说教授、博士生导师。主要研究方向包括,图的结构理论、哈密尔顿圈与因子存在性及极值问题、算法复杂性等。主持国家自然科学基金面上项目4项,教育部留学回国基金项目1项,在《组合理论,系列b图论》杂志上Discrete Mathematics, Discrete Applied Mathematics等图论权威期刊发表SCI论文110余篇.