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

DOI10.1007/978-3-030-75242-2_7MaRDI QIDQ2692720zbMATH OpenOpenAlexFDO

Authors Julien Bensmail, Foivos Fioravantes, 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

1-2-3 conjecture3-chromatic graphsproper labellings

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• Algorithmic complexity of proper labeling problems
• Edge weights and vertex colours
• Edge weights and vertex colours: minimizing sum count
• Graph theory
• List coloring Halin graphs.
• On a 1,2 conjecture
• On backbone coloring of graphs
• On minimizing the maximum color for the 1-2-3 conjecture
• On Proper Labellings of Graphs with Minimum Label Sum
• On the complexity of vertex-coloring edge-weightings
• On the precise value of the strong chromatic index of a planar graph with a large girth
• 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

Cited in

(5)

• On the \(M_3\) versus \(M_1\) problem
• Further results on an equitable 1-2-3 conjecture
• On the role of 3s for the 1-2-3 conjecture
• A Solution to the 2/3 Conjecture
• On the use of majority for investigating primeness of 3-permutability

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2692720)