Pages that link to "Item:Q2217460"

The following pages link to On minimizing the maximum color for the 1-2-3 conjecture (Q2217460):

Displaying 9 items.

• The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
• Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture (Q1627846) (← links)
• Is there any polynomial upper bound for the universal labeling of graphs? (Q1680487) (← links)
• Further results on an equitable 1-2-3 conjecture (Q2022502) (← links)
• On proper labellings of graphs with minimum label sum (Q2118389) (← links)
• Going wide with the 1-2-3 conjecture (Q2166211) (← links)
• On the role of 3s for the 1--2--3 conjecture (Q2235774) (← links)
• On the role of 3's for the 1-2-3 conjecture (Q2692720) (← links)
• On Proper Labellings of Graphs with Minimum Label Sum (Q5041179) (← links)