1-2-3 Conjecture in digraphs: more results and directions

DOI10.1016/J.DAM.2020.03.017zbMath1443.05079OpenAlexW2972864020WikidataQ122981069 ScholiaQ122981069MaRDI QIDQ777370

Kasper Lyngsie, Julien Bensmail

Publication date: 7 July 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.03.017

zbMATH Keywords

complexityboundschoosability1-2-3 Conjecturedirected variants

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

On generalisations of the AVD conjecture to digraphs

Cites Work

• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• On a directed variation of the 1-2-3 and 1-2 conjectures
• Digraphs are 2-weight choosable
• Coloring chip configurations on graphs and digraphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Graphs are \((1, \varDelta + 1)\)-choosable
• A note on a directed version of the 1-2-3 conjecture
• Edge weights and vertex colours
• An oriented version of the 1-2-3 conjecture
• Weight choosability of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: 1-2-3 Conjecture in digraphs: more results and directions