An oriented version of the 1-2-3 conjecture

DOI10.7151/DMGT.1791zbMath1326.05043OpenAlexW2018586054WikidataQ123313735 ScholiaQ123313735MaRDI QIDQ2259576

Julien Bensmail, Olivier Baudon, Eric Sopena

Publication date: 4 March 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1791

zbMATH Keywords

complexityoriented graph1-2-3 conjectureneighbour-sum-distinguishing arc-weighting

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

On generalisations of the AVD conjecture to digraphs ⋮ A note on a directed version of the 1-2-3 conjecture ⋮ On a directed variation of the 1-2-3 and 1-2 conjectures ⋮ The neighbour-sum-distinguishing edge-colouring game ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ Weight choosability of oriented hypergraphs ⋮ 1-2-3 Conjecture in digraphs: more results and directions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Digraphs are 2-weight choosable
• Coloring chip configurations on graphs and digraphs
• 1,2 conjecture-the multiplicative version
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• On decomposing regular graphs into locally irregular subgraphs
• Vertex colouring edge partitions
• Weight choosability of graphs

This page was built for publication: An oriented version of the 1-2-3 conjecture