Abstract
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 χℓ(Gk)≥cχ(Gk)logχ(Gk). We also provide an upper bound, χℓ(Gk)<χ(Gk)3 for k>1.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
