A characterization of (4,2)‐choosable graphs
Daniel W. Cranston · Journal of Graph Theory · 2019
Abstract A 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.