On minimizing the maximum color for the 1-2-3 conjecture

DOI10.1016/J.DAM.2020.09.020MaRDI QIDQ2217460zbMATH OpenOpenAlexWikidataFDO

Authors Julien Bensmail, Bi Li, Nicolas Nisse, Binlong Li

Publication date 29 December 2020

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

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

zbMATH Keywords

1-2-3 conjectureedge labelingsproper vertex-coloringssmall vertex colors

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On the role of 3s 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
• Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture
• An injective version of the 1-2-3 conjecture

Cites work

• A partial k-arboretum of graphs with bounded treewidth
• Edge weights and vertex colours
• Edge weights and vertex colours: minimizing sum count
• Hard tiling problems with simple tiles
• On the complexity of vertex-coloring edge-weightings
• 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

(13)

• Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture
• Is there any polynomial upper bound for the universal labeling of graphs?
• Further results on an equitable 1-2-3 conjecture
• On proper labellings of graphs with minimum label sum
• Going wide with the 1-2-3 conjecture
• On the role of 3s for the 1-2-3 conjecture
• On the role of 3's for the 1-2-3 conjecture
• On maximum differential graph coloring
• The 1,2,3-conjecture and 1,2-conjecture for sparse graphs
• On Proper Labellings of Graphs with Minimum Label Sum
• Making graphs irregular through irregularising walks
• Some remarks and results on the standard (2,2)-conjecture
• Proper labellings of graphs with unlabellable edges

This page was built for publication: On minimizing the maximum color 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 Q2217460)