On locally irregular decompositions and the 1-2 Conjecture in digraphs
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 t...
Main Authors: | Olivier Baudon, Julien Bensmail, Jakub Przybyło, Mariusz Woźniak |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2018-10-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/4474/pdf |
Similar Items
-
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions
by: Olivier Baudon, et al.
Published: (2019-04-01) -
On BMRN*-colouring of planar digraphs
by: Julien Bensmail, et al.
Published: (2021-02-01) -
On the Cartesian product of of an arbitrarily partitionable graph and a traceable graph
by: Olivier Baudon, et al.
Published: (2014-04-01) -
On a 1, 2 Conjecture
by: Jakub Przybylo, et al.
Published: (2010-01-01) -
Irregular edge coloring of 2-regular graphs
by: Sylwia Cichacz, et al.
Published: (2011-02-01)