Abstract
Let G be a connected graph with n vertices and m edges. Using Whitney's broken cycle theorem, we prove that if k>m−1ln(1+2)≈1.135(m−1) then for every k-list assignment L of G, the number of L-colorings of G is at least that of ordinary k-colorings of G. This improves previous results of Donner (1992) and Thomassen (2009), who proved the result for k sufficiently large and k>n10, respectively.
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 callSimilar Papers
Disclaimer: 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.
