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 3 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)