Authors: Olivier Baudon ¹; Julien Bensmail ²; Jakub Przybyło ³; Mariusz Woźniak ³

• 1 Laboratoire Bordelais de Recherche en Informatique
• 2 Combinatorics, Optimization and Algorithms for Telecommunications
• 3 AGH University of Science and Technology [Krakow, PL]

The 1-2 Conjecture raised by Przybylo and Wozniak in 2010 asserts that every undirected graph admits a 2-total-weighting such that the sums of weights "incident" to the vertices yield a proper vertex-colouring. Following several recent works bringing related problems and notions (such as the well-known 1-2-3 Conjecture, and the notion of locally irregular decompositions) to digraphs, we here introduce and study several variants of the 1-2 Conjecture for digraphs. For every such variant, we raise conjectures concerning the number of weights necessary to obtain a desired total-weighting in any digraph. We verify some of these conjectures, while we obtain close results towards the ones that are still open.