Further results on an equitable 1-2-3 conjecture

DOI10.1016/j.dam.2021.02.037zbMath1462.05133OpenAlexW3014471301WikidataQ113877243 ScholiaQ113877243MaRDI QIDQ2022502

Foivos Fioravantes, Julien Bensmail, Nicolas Nisse, Fionn Mc Inerney

Publication date: 29 April 2021

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

Full work available at URL: https://doi.org/10.1016/j.dam.2021.02.037

zbMATH Keywords

1-2-3 conjectureequitable labellingsproper labellings

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (2)

A notion of vertex equitability for proper labellings ⋮ On the role of 3s for the 1--2--3 conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Equitable neighbour-sum-distinguishing edge and total colourings
• Edge weights and vertex colours
• On minimizing the maximum color for the 1-2-3 conjecture
• Minimum-weight triangulation is NP-hard
• On Proper Labellings of Graphs with Minimum Label Sum

This page was built for publication: Further results on an equitable 1-2-3 conjecture