- Series
- Time
- Thursday, October 17, 2019 - 4:00pm for 1 hour (actually 50 minutes)
- Location
- Skiles 005
- Speaker
- Michael Wigal – Georgia Tech
- Organizer
- Xingxing Yu
Carsten Thomassen showed for planar graphs $G$ that there exists a cycle $C$ such that every component of $G - C$ has at most three neighbors on C. This implies that 4-connected planar graphs are hamiltonian. A natural weakening is to find the circumference of essentially 4-connected planar graphs. We will cover an outline of Thomassen's proof and what is currently known on circumference bounds for essentially 4-connected planar graphs.