Chromatic polynomials and a second Hamiltonian cycle
Seminar Room 1, Newton Institute
The chromatic polynomial was introduced by Birkhoff in 1912 in order to study the 4-Color Problem. Although the chromatic polynomial has not been very successful for solving coloring problems, it has served as inspiration for other problems in graph theory. In this talk, we describe some graph problems and resuls related to the roots of a chromatic polynomial, in particular the search for a second Hamiltonian cycle. Also a possible list-chromatic polynomial will be discussed.
If it doesn't, something may have gone wrong with our embedded player.
We'll get it fixed as soon as possible.