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

DOI10.1016/J.TCS.2021.09.023MaRDI QIDQ2235774zbMATH OpenOpenAlexWikidataFDO

Authors Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney

Publication date 21 October 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.09.023

zbMATH Keywords

1--2--3 conjecture3-chromatic graphsproper labellings

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On minimizing the maximum color for the 1-2-3 conjecture
• The 1,2,3-conjecture and 1,2-conjecture for sparse graphs
• Going wide with the 1-2-3 conjecture
• Further results on an equitable 1-2-3 conjecture
• An injective version of the 1-2-3 conjecture

Cites work

• Algorithmic complexity of proper labeling problems
• Edge weights and vertex colours
• Edge weights and vertex colours: minimizing sum count
• Equitable neighbour-sum-distinguishing edge and total colourings
• Further results on an equitable 1-2-3 conjecture
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• 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
• On the role of 3's for the 1-2-3 conjecture
• 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

(17)

• On the \(M_3\) versus \(M_1\) problem
• Is there any polynomial upper bound for the universal labeling of graphs?
• Further evidence towards the multiplicative 1-2-3 conjecture
• On proper labellings of graphs with minimum label sum
• Going wide with the 1-2-3 conjecture
• On minimizing the maximum color for the 1-2-3 conjecture
• An injective version of the 1-2-3 conjecture
• New \Sigma ^1_3 facts
• The 1,2,3-conjecture and 1,2-conjecture for sparse graphs
• On Proper Labellings of Graphs with Minimum Label Sum
• The largest connected subgraph game
• On the total versions of 1-2-3-conjecture for graphs and hypergraphs
• On inducing degenerate sums through 2-labellings
• The strong (2, 2)-conjecture for more classes of graphs
• Maximising 1's through proper labellings
• On proper 2-labellings distinguishing by sums, multisets or products
• Some remarks and results on the standard (2,2)-conjecture

This page was built for publication: On the role of 3s 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 Q2235774)