Pages that link to "Item:Q2629488"

The following pages link to Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs (Q2629488):

Displaying 10 items.

• Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
• On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
• On offset Hamilton cycles in random hypergraphs (Q1701116) (← links)
• Going wide with the 1-2-3 conjecture (Q2166211) (← links)
• From the 1-2-3 conjecture to the Riemann hypothesis (Q2225418) (← links)
• On the semi-proper orientations of graphs (Q2663989) (← links)
• The 1-2-3-Conjecture for Hypergraphs (Q4978298) (← links)
• Weight choosability of oriented hypergraphs (Q5225027) (← links)
• On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
• A solution to the 1-2-3 conjecture (Q6196158) (← links)