Pages that link to "Item:Q2235774"

The following pages link to On the role of 3s for the 1--2--3 conjecture (Q2235774):

Displaying 11 items.

• The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
• On the \(M_3\) versus \(M_1\) problem (Q1570912) (← links)
• Is there any polynomial upper bound for the universal labeling of graphs? (Q1680487) (← links)
• Further evidence towards the multiplicative 1-2-3 conjecture (Q2057599) (← links)
• Going wide with the 1-2-3 conjecture (Q2166211) (← links)
• On minimizing the maximum color for the 1-2-3 conjecture (Q2217460) (← links)
• An injective version of the 1-2-3 conjecture (Q2657086) (← links)
• New $\Sigma ^1_3$ facts (Q4268930) (← links)
• The largest connected subgraph game (Q5925553) (← links)
• On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
• On inducing degenerate sums through 2-labellings (Q6154381) (← links)