Lucky labelings of graphs

DOI10.1016/j.ipl.2009.05.011zbMath1197.05125OpenAlexW2084312669MaRDI QIDQ989579

Jarosław Grytczuk, Sebastian Czerwiński, Wiktor Żelazny

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.05.011

zbMATH Keywords

combinatorial problemscombinatorial nullstellensatzlucky labeling

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

A note on adjacent vertex distinguishing colorings of graphs, A new approach on locally checkable problems, A note on additive choice number of planar graphs, Additive list coloring of planar graphs with given girth, Upper bounds on distance vertex irregularity strength of some families of graphs, Algorithmic complexity of proper labeling problems, Colourings of graphs by labellings, Graph coloring and Graham's greatest common divisor problem, The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$, Computation of lucky number of planar graphs is NP-hard, Multiplicative vertex-colouring weightings of graphs, On a total version of 1-2-3 conjecture, Magic sigma coloring of a graph, On the lucky choice number of graphs, A note on vertex colorings of plane graphs, From the 1-2-3 conjecture to the Riemann hypothesis, Topological additive numbering of directed acyclic graphs, Graphs with multiplicative vertex-coloring 2-edge-weightings, A lower bound and several exact results on the \(d\)-lucky number, Additive coloring of planar graphs, Upper bounds on inclusive distance vertex irregularity strength, Planar graphs with girth 20 are additively 3-choosable, On the additive chromatic number of several families of graphs, Coloring chip configurations on graphs and digraphs

Cites Work

• Regular subgraphs of almost regular graphs
• 1,2 conjecture-the multiplicative version
• Colorings and orientations of graphs
• On acyclic colorings of planar graphs
• Edge weights and vertex colours
• Degree constrained subgraphs
• Vertex colouring edge partitions
• Weight choosability of graphs
• Combinatorial Nullstellensatz
• Interval bigraphs and circular arc graphs