Pages that link to "Item:Q2166211"

The following pages link to Going wide with the 1-2-3 conjecture (Q2166211):

Displaying 10 items.

• The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
• On the hardness of determining the irregularity strength of graphs (Q2089679) (← links)
• On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
• Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
• On minimizing the maximum color for the 1-2-3 conjecture (Q2217460) (← links)
• On the role of 3s for the 1--2--3 conjecture (Q2235774) (← links)
• An injective version of the 1-2-3 conjecture (Q2657086) (← links)
• On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
• A notion of vertex equitability for proper labellings (Q6153474) (← links)
• On inducing degenerate sums through 2-labellings (Q6154381) (← links)