A characterization of (4, 2)‐choosable graphs. Issue 4 (22nd July 2019)

• Record Type: Journal Article
• Authors: Cranston, Daniel W.
• Is Part Of: Journal of graph theory. Volume 92:Issue 4(2019)
• Page Start: 460
• Page End: 487
• Publication Date: 2019-07-22
• Subjects: (a, b)‐choosable -- choosability -- list‐coloring; Graph theory -- Periodicals; 511
• DOI: 10.1002/jgt.22464
• Languages: English
• ISSNs: 0364-9024

Abstract

Abstract: A graph G is ( a, b ) ‐ choosable if given any list assignment L with ∣ L ( v ) ∣ = a for each v ∈ V ( G ) there exists a function φ such that φ ( v ) ⊆ L ( v ) and ∣ φ ( v ) ∣ = b for all v ∈ V ( G ), and whenever vertices x and y are adjacent φ ( x ) ∩ φ ( y ) = ∅ . Meng, Puleo, and Zhu conjectured a characterization of (4, 2)‐choosable graphs. We prove their conjecture.