Pages that link to "Item:Q2033917"

The following pages link to Total weight choosability of graphs: towards the 1-2-3-conjecture (Q2033917):

Displaying 5 items.

• On a list variant of the multiplicative 1-2-3 conjecture (Q2135540) (← links)
• Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
• Every nice graph is (1,5)-choosable (Q2171030) (← links)
• A solution to the 1-2-3 conjecture (Q6196158) (← links)
• Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment (Q6568836) (← links)