Abstract
AbstractA graph is ‐choosable if given any list assignment with for each there exists a function such that and for all , and whenever vertices and are adjacent . Meng, Puleo, and Zhu conjectured a characterization of (4,2)‐choosable graphs. We prove their conjecture.
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.
