Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Tuesday, November 13, 2018, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Michael Hoffmann

On Planar Graphs, Books, and Hamiltonian Cycles

In a book embedding of a graph all vertices are placed on a line, called spine, and every edge is drawn in a halfplane, called page, that contains the spine. No two edges drawn on the same page may cross. The page number of a graph G is the minimum number of pages in any book embedding of G. It is known that planar graphs have page number at most four, and it is a notorious open question to find a planar graph that requires four pages (or to show that three pages are always sufficient). In this talk, I will report on ongoing joint work Boris Klemz (FU Berlin) where the ultimate goal is to determine the maximum number k so that every planar graph with maximum vertex degree at most k has page number two.

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