On a list-coloring problem

Authors:
Sylvain Gravier;Frédéric Maffray;Bojan Mohar
Affiliations:
CNRS, Laboratoire Leibniz, 46 Avenue Félix Viallet, 38031 Grenoble Cédex, France;CNRS, Laboratoire Leibniz, 46 Avenue Félix Viallet, 38031 Grenoble Cédex, France;Department of Mathematics, University of Ljubljana, Slovenia
Venue:
Discrete Mathematics
Year:
2003

Citing 0
Cited 1

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

Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics

Quantified Score

Hi-index	0.05

Visualization

Abstract

We study the function f(G) defined for a graph G as the smallest integer k such that the join of G with a stable set of size k is not |V(G)|-choosable. This function was introduced recently in order to describe extremal graphs for a list-coloring version of a famous inequality due to Nordhaus and Gaddum (Dantas et al., Research Report 18, Laboratoire Leibniz-IMAG, Grenoble, 2000). Some bounds and some exact values for f(G) are determined.