Pages that link to "Item:Q2222048"
From MaRDI portal
The following pages link to The 1-2-3 conjecture almost holds for regular graphs (Q2222048):
Displaying 18 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 neighbour-distinguishing regular graphs total-weighting (Q1010694) (← links)
- A note on the weak \((2,2)\)-conjecture (Q1625809) (← links)
- A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs (Q1730218) (← links)
- Further evidence towards the multiplicative 1-2-3 conjecture (Q2057599) (← links)
- On proper labellings of graphs with minimum label sum (Q2118389) (← links)
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)
- On the standard \((2,2)\)-conjecture (Q2662793) (← links)
- The neighbour sum distinguishing relaxed edge colouring (Q2668336) (← links)
- The 1‐2‐3‐conjecture holds for dense graphs (Q4632023) (← links)
- On Proper Labellings of Graphs with Minimum Label Sum (Q5041179) (← links)
- A note on 1-2-3 conjecture for Halin graphs (Q5057739) (← links)
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees (Q6081547) (← links)
- On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
- Neighbour sum distinguishing edge-weightings with local constraints (Q6103480) (← links)
- On decomposing multigraphs into locally irregular submultigraphs (Q6105994) (← 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)
