Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Thursday, October 04, 2007, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Penny Haxell (Univ. of Waterloo)
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: 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 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.4803M | admin login