Caterina De Simone, IASI-National Council of Research Italy
Let G be a graph with n vertices and let
be its chromatic polynomial.
It was conjectured by Bartels and Welsh that
This conjecture remains open and is known as the Shameful Conjecture.
We propose two stronger conjectures and we show their validity for
several classes of graphs.
This information is available at
http://cgm.cs.mcgill.ca/~therese/seminar.
Direct questions, comments, additions to and removals from the mailing list, and
suggestions for speakers to Therese Biedl at
therese@cgm.cs.mcgill.ca.