On locally irregular decompositions and the 1-2 Conjecture in digraphs

Abstract : The 1-2 Conjecture raised by Przybylo lo 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.
Type de document :
Rapport
[Research Report] Inria, CNRS, Université de Bordeaux, AGH University. 2016
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01374427
Contributeur : Julien Bensmail <>
Soumis le : vendredi 30 septembre 2016 - 14:10:42
Dernière modification le : mercredi 14 décembre 2016 - 01:03:33
Document(s) archivé(s) le : samedi 31 décembre 2016 - 15:46:16

Fichier

12oriented.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01374427, version 1

Collections

Citation

Olivier Baudon, Julien Bensmail, Jakub Przybyło, Mariusz Woźniak. On locally irregular decompositions and the 1-2 Conjecture in digraphs. [Research Report] Inria, CNRS, Université de Bordeaux, AGH University. 2016. <hal-01374427>

Partager

Métriques

Consultations de
la notice

159

Téléchargements du document

48