Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
From MaRDI portal
Publication:965260
DOI10.1016/j.jctb.2009.06.002zbMath1209.05087OpenAlexW2075047823MaRDI QIDQ965260
Florian Pfender, Michał Karoński, Maciej Kalkowski
Publication date: 21 April 2010
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2009.06.002
Related Items
A note on adjacent vertex distinguishing colorings of graphs, Group sum chromatic number of graphs, Graphs are \((1, \varDelta + 1)\)-choosable, Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic, On decomposing graphs of large minimum degree into locally irregular subgraphs, Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz, A note on the weak \((2,2)\)-conjecture, Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture, Total weight choosability of cone graphs, On a list variant of the multiplicative 1-2-3 conjecture, New bounds for locally irregular chromatic index of bipartite and subcubic graphs, Vertex-coloring 3-edge-weighting of some graphs, Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs, A relaxed case on 1-2-3 conjecture, Neighbor sum distinguishing index of \(K_4\)-minor free graphs, A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles, Neighbour-distinguishing labellings of families of graphs, Neighbor sum distinguishing total choosability of planar graphs, The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture, Dense Eulerian graphs are \((1, 3)\)-choosable, Decomposing graphs into a constant number of locally irregular subgraphs, The edge-labeling and vertex-colors of \(K_n\), Total weight choosability of graphs with bounded maximum average degree, Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable, Going wide with the 1-2-3 conjecture, Every nice graph is (1,5)-choosable, Neighbour-distinguishing labellings of powers of paths and powers of cycles, Local antimagic orientation of graphs, Additive list coloring of planar graphs with given girth, Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz, Vertex-coloring 2-edge-weighting of graphs, Distant irregularity strength of graphs with bounded minimum degree, The sigma chromatic number of a graph, Is there any polynomial upper bound for the universal labeling of graphs?, Neighbor sum distinguishing index of 2-degenerate graphs, Algorithmic complexity of proper labeling problems, Distant irregularity strength of graphs, Neighbor sum distinguishing index of planar graphs, List neighbor sum distinguishing edge coloring of subcubic graphs, Distant set distinguishing edge colourings of graphs, Colourings of graphs by labellings, Colour-blind can distinguish colour pallets, Graph coloring and Graham's greatest common divisor problem, Local antimagic labeling of graphs, Multiplicative vertex-colouring weightings of graphs, On the neighbor sum distinguishing total coloring of planar graphs, On a total version of 1-2-3 conjecture, Weight choosability of graphs with maximum degree 4, On the neighbour sum distinguishing index of graphs with bounded maximum average degree, Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring, On offset Hamilton cycles in random hypergraphs, Neighbor sum distinguishing total coloring of sparse IC-planar graphs, On total weight choosability of graphs, Total weight choosability of Cartesian product of graphs, A note on asymptotically optimal neighbour sum distinguishing colourings, The complexity of the proper orientation number, On minimizing the maximum color for the 1-2-3 conjecture, Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24, A note on face coloring entire weightings of plane graphs, The 1-2-3 conjecture almost holds for regular graphs, The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs, A note on vertex colorings of plane graphs, From the 1-2-3 conjecture to the Riemann hypothesis, Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz, A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs, Local antimagic orientations of \(d\)-degenerate graphs, Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9, On the role of 3s for the 1--2--3 conjecture, An improved upper bound on edge weight choosability of graphs, Neighbor sum distinguishing total colorings of planar graphs, Vertex coloring of graphs by total 2-weightings, A note on neighbor expanded sum distinguishing index, Permanent index of matrices associated with graphs, The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles, Total weight choosability of Mycielski graphs, Graphs with multiplicative vertex-coloring 2-edge-weightings, On a directed variation of the 1-2-3 and 1-2 conjectures, On weight choosabilities of graphs with bounded maximum average degree, Every graph is \((2,3)\)-choosable, The neighbour-sum-distinguishing edge-colouring game, A note on edge weightings inducing proper vertex colorings, An oriented version of the 1-2-3 conjecture, Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs, Distant sum distinguishing index of graphs, Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture, Further results on an equitable 1-2-3 conjecture, Equitable neighbour-sum-distinguishing edge and total colourings, Neighbor sum distinguishing total coloring of graphs with bounded treewidth, An improved upper bound on neighbor expanded sum distinguishing index, Total weight choosability of graphs: towards the 1-2-3-conjecture, On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs, Additive coloring of planar graphs, Further evidence towards the multiplicative 1-2-3 conjecture, 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 total-neighbor-distinguishing index by sums, On decomposing regular graphs into locally irregular subgraphs, Neighbor sum distinguishing total colorings of triangle free planar graphs, On proper labellings of graphs with minimum label sum, On Proper Labellings of Graphs with Minimum Label Sum, A note on 1-2-3 conjecture for Halin graphs, Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree, Asymptotically optimal neighbour sum distinguishing colourings of graphs, Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited, An injective version of the 1-2-3 conjecture, On the standard \((2,2)\)-conjecture, Total Weight Choosability of Trees, A generalization of Faudree–Lehel conjecture holds almost surely for random graphs, Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees, A proof of the multiplicative 1-2-3 conjecture, On the total versions of 1-2-3-conjecture for graphs and hypergraphs, On decomposing multigraphs into locally irregular submultigraphs, The weak \((2, 2)\)-labelling problem for graphs with forbidden induced structures, 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, Total weight choosability of graphs, NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS, A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS, Antimagic Properties of Graphs with Large Maximum Degree, Unnamed Item, Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz, Total weight choosability for Halin graphs, Distant sum distinguishing index of graphs with bounded minimum degree, Weight choosability of oriented hypergraphs, On the Neighbor Sum Distinguishing Index of Planar Graphs, The 1-2-3-Conjecture for Hypergraphs, Highly Irregular, Unnamed Item
Cites Work
