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

DOI10.1016/j.dam.2020.09.020zbMath1454.05103OpenAlexW2985356986WikidataQ123252259 ScholiaQ123252259MaRDI QIDQ2217460

Julien Bensmail, Nicolas Nisse, Bi Li, Bin Long 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

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

Related Items (5)

On Proper Labellings of Graphs with Minimum Label Sum ⋮ 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
• 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
• 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

This page was built for publication: On minimizing the maximum color for the 1-2-3 conjecture