On Generalisations of the AVD Conjecture to Digraphs

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 gra...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Graphs and combinatorics 2021-03, Vol.37 (2), p.545-558
Hauptverfasser:	Bensmail, Julien, Mc Inerney, Fionn
Format:	Artikel
Sprache:	eng
Schlagworte:	Apexes Combinatorics Computer Science Discrete Mathematics Engineering Design Graph coloring Graph theory Mathematics Mathematics and Statistics Original Paper
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!