
| Mittagsseminar Talk Information | |
Date and Time: Thursday, October 04, 2007, 12:15 pm Duration: This information is not available in the database Location: CAB G51 Speaker: Penny Haxell (Univ. of Waterloo) Independent dominating sets and Hamilton cycles
A graph is said to be uniquely Hamiltonian if it contains
exactly one Hamilton cycle. An old conjecture of Sheehan states that
there are no 4-regular uniquely Hamiltonian graphs. We
show that there are no r-regular
uniquely Hamiltonian graphs for any r>22. We use the approach of
Thomassen, who proved that for any graph G with a Hamilton cycle
C, if G contains a vertex subset S that is independent in
C and dominating in G-C, then G has a Hamilton
cycle different from C.
Joint work with B. Seamone and J. Verstraete.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!) Previous talks by year: 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996 Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.3392 | admin login
|