Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
From MaRDI portal
Publication:965260
DOI10.1016/j.jctb.2009.06.002zbMath1209.05087MaRDI 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
NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS, Antimagic Properties of Graphs with Large Maximum Degree, On the Neighbor Sum Distinguishing Index of Planar Graphs, The 1-2-3-Conjecture for Hypergraphs, Distant sum distinguishing index of graphs with bounded minimum degree, Weight choosability of oriented hypergraphs, Total Weight Choosability of Trees, A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS, Highly Irregular, Total weight choosability of graphs, Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz, A note on adjacent vertex distinguishing colorings of graphs, Group sum chromatic number of graphs, 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, Total weight choosability of cone graphs, A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles, Neighbor sum distinguishing total choosability of planar graphs, The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture, Decomposing graphs into a constant number of locally irregular subgraphs, Algorithmic complexity of proper labeling problems, Distant irregularity strength of graphs, Neighbor sum distinguishing index of planar graphs, Colour-blind can distinguish colour pallets, Multiplicative vertex-colouring weightings of graphs, Total weight choosability of Cartesian product of graphs, The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs, A note on vertex colorings of plane graphs, Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz, 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, Vertex-coloring 2-edge-weighting of graphs, The sigma chromatic number of a graph, Neighbor sum distinguishing total coloring of graphs with bounded treewidth, On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs, Additive coloring of planar graphs, 1-2-3 Conjecture in digraphs: more results and directions, On the neighbor sum distinguishing total coloring of planar graphs, Graphs are \((1, \varDelta + 1)\)-choosable, A note on the weak \((2,2)\)-conjecture, Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture, New bounds for locally irregular chromatic index of bipartite and subcubic graphs, Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable, Is there any polynomial upper bound for the universal labeling of graphs?, Neighbor sum distinguishing index of 2-degenerate graphs, List neighbor sum distinguishing edge coloring of subcubic graphs, Distant set distinguishing edge colourings of graphs, Colourings of graphs by labellings, Graph coloring and Graham's greatest common divisor problem, 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, A note on asymptotically optimal neighbour sum distinguishing colourings, 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, A note on edge weightings inducing proper vertex colorings, Equitable neighbour-sum-distinguishing edge and total colourings, On total weight choosability of graphs, Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs, Distant sum distinguishing index of graphs, 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, An oriented version of the 1-2-3 conjecture, Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture, An improved upper bound on neighbor expanded sum distinguishing index, 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, Vertex-coloring 3-edge-weighting of some graphs, The edge-labeling and vertex-colors of \(K_n\), Total weight choosability of graphs with bounded maximum average degree, Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz, Distant irregularity strength of graphs with bounded minimum degree, Local antimagic labeling of graphs, The complexity of the proper orientation number, A note on face coloring entire weightings of plane 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, 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
Cites Work
