Publication:5403005
From MaRDI portal
zbMath1283.05093MaRDI QIDQ5403005
Publication date: 25 March 2014
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/1508/0.html
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Signed and weighted graphs (05C22)
Related Items
On Proper Labellings of Graphs with Minimum Label Sum, Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture, Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs, Neighbour-distinguishing labellings of families of graphs, A note on 1-2-3 conjecture for Halin graphs, The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture, Going wide with the 1-2-3 conjecture, An injective version of the 1-2-3 conjecture, On the standard \((2,2)\)-conjecture, Neighbour-distinguishing labellings of powers of paths and powers of cycles, Algorithmic complexity of proper labeling problems, Neighbour sum distinguishing edge-weightings with local constraints, A notion of vertex equitability for proper labellings, On inducing degenerate sums through 2-labellings, A solution to the 1-2-3 conjecture, On the role of 3's for the 1-2-3 conjecture, On minimizing the maximum color for the 1-2-3 conjecture, The 1-2-3 conjecture almost holds for regular graphs, From the 1-2-3 conjecture to the Riemann hypothesis, A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs, On the role of 3s for the 1--2--3 conjecture, On the complexity of determining the irregular chromatic index of a graph, Further results on an equitable 1-2-3 conjecture, On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs, On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\), Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs, 1-2-3 Conjecture in digraphs: more results and directions, Edge weights and vertex colours: minimizing sum count, On the hardness of determining the irregularity strength of graphs, On proper labellings of graphs with minimum label sum
