The following pages link to (Q5403005):
Displaying 30 items.
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- 1-2-3 Conjecture in digraphs: more results and directions (Q777370) (← links)
- Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture (Q1627846) (← links)
- A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs (Q1730218) (← 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)
- Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs (Q2077391) (← links)
- On the hardness of determining the irregularity strength of graphs (Q2089679) (← links)
- On proper labellings of graphs with minimum label sum (Q2118389) (← links)
- Neighbour-distinguishing labellings of families of graphs (Q2141099) (← links)
- Going wide with the 1-2-3 conjecture (Q2166211) (← links)
- Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
- On minimizing the maximum color for the 1-2-3 conjecture (Q2217460) (← links)
- The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
- From the 1-2-3 conjecture to the Riemann hypothesis (Q2225418) (← links)
- On the role of 3s for the 1--2--3 conjecture (Q2235774) (← links)
- On the complexity of determining the irregular chromatic index of a graph (Q2253909) (← links)
- Edge weights and vertex colours: minimizing sum count (Q2334038) (← links)
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs (Q2629488) (← links)
- An injective version of the 1-2-3 conjecture (Q2657086) (← links)
- On the standard \((2,2)\)-conjecture (Q2662793) (← links)
- On the role of 3's for the 1-2-3 conjecture (Q2692720) (← links)
- On Proper Labellings of Graphs with Minimum Label Sum (Q5041179) (← links)
- A note on 1-2-3 conjecture for Halin graphs (Q5057739) (← links)
- Neighbour sum distinguishing edge-weightings with local constraints (Q6103480) (← links)
- A notion of vertex equitability for proper labellings (Q6153474) (← links)
- On inducing degenerate sums through 2-labellings (Q6154381) (← links)
- A solution to the 1-2-3 conjecture (Q6196158) (← links)