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

DOI10.1016/J.DAM.2020.03.017zbMATH Open1443.05079OpenAlexW2972864020WikidataQ122981069 ScholiaQ122981069MaRDI QIDQ777370FDOQ777370

Authors: Julien Bensmail, Kasper Lyngsie 

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

Recommendations

• On a directed variation of the 1-2-3 and 1-2 conjectures
• A note on a directed version of the 1-2-3 conjecture
• An oriented version of the 1-2-3 conjecture
• On locally irregular decompositions and the 1-2 conjecture in digraphs
• Digraphs are 2-weight choosable

zbMATH Keywords

complexityboundschoosability1-2-3 Conjecturedirected variants

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (4)

• The 1‐2‐3‐conjecture holds for dense graphs
• A conjecture on 3-anti-quasi-transitive digraphs
• Adding direction constraints to the 1-2-3 conjecture
• On generalisations of the AVD conjecture to digraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q777370)