On Proper Labellings of Graphs with Minimum Label Sum

DOI10.1007/978-3-030-48966-3_5MaRDI QIDQ5041179

Nicolas Nisse, Foivos Fioravantes, Julien Bensmail

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

1-2-3 conjectureminimum label sumproper labelling

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (5)

Going wide with the 1-2-3 conjecture ⋮ On the role of 3's for the 1-2-3 conjecture ⋮ On the role of 3s for the 1--2--3 conjecture ⋮ Further results on an equitable 1-2-3 conjecture ⋮ On proper labellings of graphs with minimum label sum

Cites Work

• Unnamed Item
• Unnamed Item
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• Vertex-coloring edge-weightings of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Equitable neighbour-sum-distinguishing edge and total colourings
• Edge weights and vertex colours
• On proper labellings of graphs with minimum label sum
• On minimizing the maximum color for the 1-2-3 conjecture
• The 1-2-3 conjecture almost holds for regular graphs
• Edge weights and vertex colours: minimizing sum count
• How to Define an Irregular Graph
• Minimum-weight triangulation is NP-hard

This page was built for publication: On Proper Labellings of Graphs with Minimum Label Sum