On a list-coloring problem

@article{Gravier2003OnAL,
  title={On a list-coloring problem},
  author={Sylvain Gravier and Fr{\'e}d{\'e}ric Maffray and Bojan Mohar},
  journal={Discrete Mathematics},
  year={2003},
  volume={268},
  pages={303-308}
}
We study the function f G de ned for a graph G as the smallest integer k such that the join ofG with a stable set of size k is not jV G j 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 Some bounds and some exact values for f G are determined 

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
2 Extracted Citations
3 Extracted References
Similar Papers

Citing Papers

Publications influenced by this paper.

Referenced Papers

Publications referenced by this paper.
Showing 1-3 of 3 references

F

  • S. Dantas, S. Gravier
  • Ma ray, Extremal graphs for the list-coloring…
  • 2000
Highly Influential
4 Excerpts

3-choosable complete bipartite graphs

  • N.V.R. Mahadev, F. S. Roberts, P. Santhanakrishnan
  • RUTCOR Research Report 49-91, Rutgers Univ., NJ…
  • 1991
2 Excerpts

Vertex colourings with given colors (in Russian)

  • V. G. Vizing
  • Metody Discret. Analiz. 29
  • 1976
1 Excerpt

Similar Papers

Loading similar papers…