Pages that link to "Item:Q1690251"

The following pages link to Multi-set neighbor distinguishing 3-edge coloring (Q1690251):

Displaying 10 items.

• Neighbor-distinguishing \(k\)-tuple edge-colorings of graphs (Q1044992) (← links)
• Neighborhood distinguishing coloring in graphs (Q2016994) (← links)
• Further evidence towards the multiplicative 1-2-3 conjecture (Q2057599) (← links)
• Neighbour-distinguishing labellings of families of graphs (Q2141099) (← links)
• From the 1-2-3 conjecture to the Riemann hypothesis (Q2225418) (← links)
• On the standard \((2,2)\)-conjecture (Q2662793) (← links)
• Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees (Q6081547) (← links)
• On decomposing multigraphs into locally irregular submultigraphs (Q6105994) (← links)
• The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures (Q6132535) (← links)
• A solution to the 1-2-3 conjecture (Q6196158) (← links)