Title of article :
Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum Original Research Article
Author/Authors :
Simone Dantas، نويسنده , , Sylvain Gravier and Julien Moncel، نويسنده , , Frédéric Maffray، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2004
Abstract :
We characterize the graphs G such that Ch(G)+Ch(Ḡ)=n+1, where Ch(G) is the choice number (list-chromatic number) of G and n is its number of vertices.
Keywords :
List coloring , Graph coloring
Journal title :
Discrete Applied Mathematics
Journal title :
Discrete Applied Mathematics
