A note on a directed version of the 1-2-3 conjecture
From MaRDI portal
Publication:1693177
DOI10.1016/j.dam.2017.11.016zbMath1377.05060OpenAlexW2774249045WikidataQ122979018 ScholiaQ122979018MaRDI QIDQ1693177
Mariusz Woźniak, Jakub Przybyło, Mirko Horňák
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.11.016
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Directed graphs (digraphs), tournaments (05C20)
Related Items (3)
On generalisations of the AVD conjecture to digraphs ⋮ A lower bound and several exact results on the \(d\)-lucky number ⋮ 1-2-3 Conjecture in digraphs: more results and directions
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
- Coloring chip configurations on graphs and digraphs
- Edge weights and vertex colours
- An oriented version of the 1-2-3 conjecture
- Bounding the weight choosability number of a graph
- A New Upper Bound for the Irregularity Strength of Graphs
This page was built for publication: A note on a directed version of the 1-2-3 conjecture
