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, August 25, 2022, 12:15 pm
Duration: 30 minutes
Location: OAT S15/S16/S17
Speaker: Emanuel Seemann
We investigate the Hamiltonicity and matching properties of 1-planar graphs, a class of beyond planar graphs that allow for at most one crossing per edge. In 2019 Biedl generalized a known Hamiltonicity result by Tutte for planar graphs to 1-planar graphs. Biedl showed that a certain subclass of 4-connected 1-planar graphs is Hamiltonian. We prove that one can prescribe an edge to this Hamiltonian cycle. Using our result we provide sufficient conditions under which all matchings of size 1 and 2 can be extended to a perfect matching in an even 1-planar graph. This generalizes previous results by Plummer for planar graphs and Fujisawa et al. for 1-planar graphs.
The results are part of my master's thesis "Matchings and Hamiltonian cycles in 1-planar graphs" supervised by Michael Hoffmann, Meghana Mallik Reddy and Emo Welzl.
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2024 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