Group colloquium: Two hamiltonian properties of graphs on the condition of toughness

When: April 11, 2019, 15:45 - Jan. 11, 2019, 16:30

Where: Ravelijn 2503

Who: Wei Zheng

In this talk I will introduce two kinds of Hamiltonian properties of graphs, Hamiltonian-connectedness and pancyclicity. They both have stronger requirements for graphs than Hamilton cycle (a cycle passing through every vertex of graph one time). Then I will give sufficient conditions for these two properties respectively, by forbidding some induced subgraphs and by limiting the toughness of graph.