On the role of 3's for the 1-2-3 conjecture

DOI10.1007/978-3-030-75242-2_7OpenAlexW3093916768MaRDI QIDQ2692720

Foivos Fioravantes, Julien Bensmail, Fionn Mc Inerney

Publication date: 22 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_7

zbMATH Keywords

3-chromatic graphs1-2-3 conjectureproper labellings

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (1)

On the role of 3s for the 1--2--3 conjecture

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
• Algorithmic complexity of proper labeling problems
• On backbone coloring of graphs
• Vertex-coloring edge-weightings of graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• On the precise value of the strong chromatic index of a planar graph with a large girth
• Edge weights and vertex colours
• On minimizing the maximum color for the 1-2-3 conjecture
• Edge weights and vertex colours: minimizing sum count
• Graph Theory
• On Proper Labellings of Graphs with Minimum Label Sum

This page was built for publication: On the role of 3's for the 1-2-3 conjecture