Skip to Main content Skip to Navigation
Journal articles

On Generalisations of the AVD Conjecture to Digraphs

Julien Bensmail 1 Fionn Mc Inerney 2
1 COATI - Combinatorics, Optimization and Algorithms for Telecommunications
CRISAM - Inria Sophia Antipolis - Méditerranée , Laboratoire I3S - COMRED - COMmunications, Réseaux, systèmes Embarqués et Distribués
Abstract : Given an undirected graph, in the AVD (edge-colouring) Conjecture, the goal is to find a proper edge-colouring with the least number of colours such that every two adjacent vertices are incident to different sets of colours. More precisely, the conjecture says that, a few exceptions apart, every graph G should admit such an edge-colouring with at most $∆(G)+2$ colours. Several aspects of interest behind this problem have been investigated over the recent years, including verifications of the conjecture for particular graph classes, general approximations of the conjecture, and multiple generalisations. In this paper, following a recent work of Sopena and Woźniak, generalisations of the AVD Conjecture to digraphs are investigated. More precisely, four of the several possible ways of generalising the conjecture are focused upon. We completely settle one of our four variants, while, for the three remaining ones, we provide partial results.
Document type :
Journal articles
Complete list of metadata

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02613858
Contributor : Julien Bensmail Connect in order to contact the contributor
Submitted on : Friday, October 30, 2020 - 3:20:11 PM
Last modification on : Tuesday, October 19, 2021 - 10:50:30 PM

File

avd-directed.pdf
Files produced by the author(s)

Identifiers

Citation

Julien Bensmail, Fionn Mc Inerney. On Generalisations of the AVD Conjecture to Digraphs. Graphs and Combinatorics, Springer Verlag, 2021, 37, pp.545-558. ⟨10.1007/s00373-020-02263-9⟩. ⟨hal-02613858v2⟩

Share

Metrics

Record views

306

Files downloads

243