COLLOQUIUM
DEPARTMENT OF MATHEMATICS AND STATISTICS
OAKLAND UNIVERSITY
ROCHESTER, MICHIGAN 48309
Eddie Cheng
Oakland University
On the 4-ordered Hamiltonicity problem
Abstract
A graph G is k-ordered Hamiltonian if for any sequence of k distinct vertices of G, there exists a Hamiltonian cycle in G containing these k vertices in the specified order. Ng and Schultz asked in 1997 whether there exists an infinite class of 3-regular 4-ordered Hamiltonian graphs. We answered the question by exhibiting such a class. In addition, we will present a number of results that are related to this question as well as a conjecture of Alspach.
Joint work with Laszlo Liptak, David Sherman, David Lu, Randy Jia, Lih-Hsing Hsu, Jimmy J. M. Tan, Cheng-Kuan Lin, Chung-Nan Hung, and Ming Tsai.
Tuesday, October 30, 2012
3:00– 4:00 P.M.
372 Science and Engineering Building
(Refreshments at 2:30-3:00 PM in the kitchen area adjacent to 368 SEB)