On a total version of 1-2-3 conjecture

DOI10.7151/dmgt.2223zbMath1446.05028OpenAlexW2810445396WikidataQ123005835 ScholiaQ123005835MaRDI QIDQ2194539

Mariusz Woźniak, Monika Pilśniak, Antoni Marczyk, Hervé Hocquard, Jakub Przybyło, Olivier Baudon

Publication date: 26 August 2020

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

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

zbMATH Keywords

total coloringneighbor sum distinguishing total coloringneighbor-distinguishing indexgeneral edge coloringneighbor full sum distinguishing total \(k\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Going wide with the 1-2-3 conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on adjacent vertex distinguishing colorings of graphs
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• A note on neighbor expanded sum distinguishing index
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Lucky labelings of graphs
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• Edge weights and vertex colours
• On the 1-2-3-conjecture