The following pages link to On the 1-2-3-conjecture (Q5249227):
Displaying 11 items.
- Graphs with vertex-coloring and detectable 2-edge-weighting (Q334127) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- 1,2 conjecture-the multiplicative version (Q963408) (← links)
- On the \(M_3\) versus \(M_1\) problem (Q1570912) (← links)
- Further results on an equitable 1-2-3 conjecture (Q2022502) (← links)
- On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\) (Q2062679) (← links)
- Neighbour-distinguishing labellings of families of graphs (Q2141099) (← links)
- Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
- On a total version of 1-2-3 conjecture (Q2194539) (← links)
- A Solution to the 2/3 Conjecture (Q3192162) (← links)
- On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
