Colloquium Announcement
Department of Mathematics
West Virginia University
for
Thursday, October 8,1998, at 3:45pm
in 315 Armstrong Hall
(Tea and cookies begin at 3:00 in coffee room.)
Professor Xingxing Yu
Georgia Tech
The Hamilton cycle problem for embedded graphs
The talk will be suitable for a general audience.
Students are strongly encouraged to participate.
Abstract
A Hamilton cycle in a graph is a cycle which uses all vertices. The
Hamilton cycle problem is to determine if a given graph contains a Hamilton
cycle. An embedded graph is a graph which is embedded on a surface. In this
talk, I will discuss results on Hamilton cycles in embedded graphs, including
recent solutions of several long standing conjectures.
The information on the future (and past) Colloquia can be also found on web at the
address:
http://www.math.wvu.edu/homepages/kcies/colloquium.html