Digraphs are 2-weight choosable.

Khatirinejad, Mahdad, et al. "Digraphs are 2-weight choosable.." The Electronic Journal of Combinatorics [electronic only] 18.1 (2011): Research Paper P21, 4 p., electronic only-Research Paper P21, 4 p., electronic only. <http://eudml.org/doc/228343>.

@article{Khatirinejad2011,
author = {Khatirinejad, Mahdad, Naserasr, Reza, Newman, Mike, Seamone, Ben, Stevens, Brett},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {edge weighting vertex coloring; weight colorability; digraphs},
language = {eng},
number = {1},
pages = {Research Paper P21, 4 p., electronic only-Research Paper P21, 4 p., electronic only},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Digraphs are 2-weight choosable.},
url = {http://eudml.org/doc/228343},
volume = {18},
year = {2011},
}

TY - JOUR
AU - Khatirinejad, Mahdad
AU - Naserasr, Reza
AU - Newman, Mike
AU - Seamone, Ben
AU - Stevens, Brett
TI - Digraphs are 2-weight choosable.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2011
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 18
IS - 1
SP - Research Paper P21, 4 p., electronic only
EP - Research Paper P21, 4 p., electronic only
LA - eng
KW - edge weighting vertex coloring; weight colorability; digraphs
UR - http://eudml.org/doc/228343
ER -