Multi-set neighbor distinguishing 3-edge coloring

DOI10.1016/J.DISC.2017.12.001zbMath1378.05074OpenAlexW2778683627MaRDI QIDQ1690251

Bojan Vučković

Publication date: 19 January 2018

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.12.001

zbMATH Keywords

color codegraph without isolated edges

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (9)

Neighbour-distinguishing labellings of families of graphs ⋮ On the standard \((2,2)\)-conjecture ⋮ Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees ⋮ A proof of the multiplicative 1-2-3 conjecture ⋮ On decomposing multigraphs into locally irregular submultigraphs ⋮ The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures ⋮ A solution to the 1-2-3 conjecture ⋮ From the 1-2-3 conjecture to the Riemann hypothesis ⋮ Further evidence towards the multiplicative 1-2-3 conjecture

Cites Work

• Edge weights and vertex colours
• Vertex colouring edge partitions
• Unnamed Item

This page was built for publication: Multi-set neighbor distinguishing 3-edge coloring