CSM
Seminar
Chromatic zeros for some recursively defined families of graphs
Thursday 24 January 2008, 16:00-16:30
Seminar Room 1, Newton Institute
Abstract
We consider some infinite families of recursively defined graphs. The explicite formulas for chromatic polynomials of graphs from the families will be presented. We study the problem of the location of their complex zeros.
![[pdf]](/images/icon/icon-pdf.gif){kind=icon}
![[dvi]](/images/icon/icon-dvi.gif){kind=icon}
MP3Flash Player is required to view the embedded video. Get the Flash Player.