Pages that link to "Item:Q4632023"

The following pages link to The 1‐2‐3‐conjecture holds for dense graphs (Q4632023):

Displaying 9 items.

• Ohba's conjecture is true for graphs \(K_{t+2,3,2\ast(k-t-2),1\ast t}\) (Q277100) (← links)
• A note on the weak \((2,2)\)-conjecture (Q1625809) (← links)
• Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
• The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
• Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
• On the standard \((2,2)\)-conjecture (Q2662793) (← links)
• A note on 1-2-3 conjecture for Halin graphs (Q5057739) (← 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)