A note on list-coloring powers of graphs

  title={A note on list-coloring powers of graphs},
  author={Nicholas Kosar and S{\'a}rka Petrickova and Benjamin Reiniger and Elyse Yeager},
  journal={Discrete Mathematics},
Recently, Kim and Park have found an infinite family of graphs whose squares are not chromatic-choosable. Xuding Zhu asked whether there is some k such that all kth power graphs are chromatic-choosable. We answer this question in the negative: we show that there is a positive constant c such that for any k there is a family of graphs G with χ(Gk) unbounded and χl(G) ≥ cχ(Gk) logχ(Gk). We also provide an upper bound, χl(G) < χ(Gk)3 for k > 1. © 2014 Elsevier B.V. All rights reserved. 
Highly Cited
This paper has 17 citations. REVIEW CITATIONS
Related Discussions
This paper has been referenced on Twitter 2 times. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper


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

Choosability of graph powers, August 2013. http://www.openproblemgarden.org/op/choosability_of_graph_powers

Jonathan A. Noel
View 2 Excerpts

Choice Numbers of Graphs: a Probabilistic Approach

Combinatorics, Probability & Computing • 1992