On a directed variation of the 1-2-3 and 1-2 conjectures
From MaRDI portal
Publication:516801
DOI10.1016/j.dam.2016.08.013zbMath1358.05122OpenAlexW2519709023WikidataQ122928473 ScholiaQ122928473MaRDI QIDQ516801
Julien Bensmail, Emma Barme, Mariusz Woźniak, Jakub Przybyło
Publication date: 15 March 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2016.08.013
Related Items (4)
On generalisations of the AVD conjecture to digraphs ⋮ A note on a directed version of the 1-2-3 conjecture ⋮ Algorithmic complexity of weakly semiregular partitioning and the representation number ⋮ 1-2-3 Conjecture in digraphs: more results and directions
Cites Work
- Unnamed Item
- Decomposing oriented graphs into six locally irregular oriented graphs
- Digraphs are 2-weight choosable
- Vertex-coloring edge-weightings of graphs
- Coloring chip configurations on graphs and digraphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Edge weights and vertex colours
- An oriented version of the 1-2-3 conjecture
- On decomposing regular graphs into locally irregular subgraphs
This page was built for publication: On a directed variation of the 1-2-3 and 1-2 conjectures
