Prof. Emo Welzl and Prof. Bernd Gärtner
|Mittagsseminar Talk Information|
Date and Time: Tuesday, November 13, 2018, 12:15 pm
Duration: 30 minutes
Location: CAB G51
Speaker: Michael Hoffmann
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.
Automatic MiSe System Software Version 1.4803M | admin login