Chromatic polynomials and a second Hamiltonian cycle

1 hour 4 mins 58 secs,  898.51 MB,  MPEG-4 Video  480x360,  25.0 fps,  44100 Hz,  1.84 Mbits/sec
About this item
Image inherited from collection
Description: Thomassen, C (Technical University of Denmark)
Monday 21 January 2008, 14:00-15:00
Zeros of Graph Polynomials
 
Created: 2008-01-31 10:56
Collection: Combinatorics and Statistical Mechanics
Publisher: Isaac Newton Institute
Copyright: Thomassen, C
Language: eng (English)
Credits:
Author:  Thomassen, C
Producer:  Steve Greenham
 
Abstract: 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.
Available Formats
Format Quality Bitrate Size
MPEG-4 Video * 480x360    1.84 Mbits/sec 898.51 MB View Download
Flash Video 480x360    806.39 kbits/sec 384.30 MB View Download
iPod Video 480x360    505.23 kbits/sec 240.77 MB View Download
Windows Media Video (for download) 480x360    477.75 kbits/sec 227.68 MB View Download
Windows Media Video (for streaming) 480x360    446.84 kbits/sec 212.95 MB View Download Stream
RealMedia 480x360    877.8 kbits/sec 418.33 MB View Download Stream
QuickTime (for download) 384x288    848.37 kbits/sec 404.30 MB View Download
QuickTime (for streaming) 480x360    907.03 kbits/sec 432.26 MB View Download
MP3 44100 Hz 125.01 kbits/sec 59.36 MB Listen Download