On a directed variation of the 1-2-3 and 1-2 conjectures

DOI10.1016/J.DAM.2016.08.013zbMATH Open1358.05122OpenAlexW2519709023WikidataQ122928473 ScholiaQ122928473MaRDI QIDQ516801FDOQ516801

Authors: Emma Barme, Julien Bensmail, Jakub Przybyło, Mariusz Woźniak 

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

Recommendations

• 1-2-3 Conjecture in digraphs: more results and directions
• On locally irregular decompositions and the 1-2 conjecture in digraphs
• A note on a directed version of the 1-2-3 conjecture
• An oriented version of the 1-2-3 conjecture
• Total weight choosability of graphs: towards the 1-2-3-conjecture

zbMATH Keywords

digraphs1-2-3 conjecture1-2 conjecture

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Edge weights and vertex colours
• On a \(1,2\) conjecture
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On decomposing regular graphs into locally irregular subgraphs
• Vertex-coloring edge-weightings of graphs
• Decomposing oriented graphs into six locally irregular oriented graphs
• Digraphs are 2-weight choosable
• An oriented version of the 1-2-3 conjecture
• Coloring chip configurations on graphs and digraphs

Cited In (7)

• An oriented version of the 1-2-3 conjecture
• On locally irregular decompositions and the 1-2 conjecture in digraphs
• 1-2-3 Conjecture in digraphs: more results and directions
• Adding direction constraints to the 1-2-3 conjecture
• A note on a directed version of the 1-2-3 conjecture
• On generalisations of the AVD conjecture to digraphs
• Algorithmic complexity of weakly semiregular partitioning and the representation number

This page was built for publication: On a directed variation of the 1-2-3 and 1-2 conjectures

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