Digraphs are 2-weight choosable
From MaRDI portal
Publication:625384
zbMath1205.05101MaRDI QIDQ625384
Mahdad Khatirinejad, Brett Stevens, Reza Naserasr, Ben Seamone, Michael W. Newman
Publication date: 17 February 2011
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/228343
Related Items
Algorithmic complexity of proper labeling problems, A solution to the 1-2-3 conjecture, Local antimagic orientations of \(d\)-degenerate graphs, On a directed variation of the 1-2-3 and 1-2 conjectures, An oriented version of the 1-2-3 conjecture, On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs, Weight choosability of oriented hypergraphs, 1-2-3 Conjecture in digraphs: more results and directions