Extremal graphs for the list-coloring version of a theorem of Nordhaus and Gaddum

Authors:
Simone Dantas;Sylvain Gravier;Frédéric Maffray
Affiliations:
Universidade Federal do Rio de Janeiro, COPPE, Brazil;CNRS, Laboratoire Leibniz, 46 Avenue Félix Viallet, 38031 Grenoble Cédex, France;Universidade Federal do Rio de Janeiro, COPPE, Brazil
Venue:
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Year:
2004

Citing 5
Cited 0

Graphs with no induced C4 and 2K2

Discrete Mathematics
Linear recognition of pseudo-split graphs

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
On a list-coloring problem

Discrete Mathematics
Graphs whose choice number is equal to their chromatic number

Journal of Graph Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We characterize the graphs G such that Ch(G)+Ch(G-)=n+1, where Ch(G) is the choice number (list-chromatic number) of G and n is its number of vertices.