Recommendations
Cites work
- 1,2 conjecture-the multiplicative version
- Colorings and orientations of graphs
- Combinatorial Nullstellensatz
- Degree constrained subgraphs
- Edge weights and vertex colours
- Interval bigraphs and circular arc graphs
- On acyclic colorings of planar graphs
- Regular subgraphs of almost regular graphs
- Vertex colouring edge partitions
- Weight choosability of graphs
Cited in
(30)- Colourings of graphs by labellings
- Graph coloring and Graham's greatest common divisor problem
- On the lucky choice number of graphs
- Upper bounds on inclusive distance vertex irregularity strength
- 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
- On a total version of 1-2-3 conjecture
- From the 1-2-3 conjecture to the Riemann hypothesis
- A lower bound and several exact results on the \(d\)-lucky number
- Planar graphs with girth 20 are additively 3-choosable
- On the additive chromatic number of several families of graphs
- A note on adjacent vertex distinguishing colorings of graphs
- The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$
- Algorithmic complexity of proper labeling problems
- Computation of lucky number of planar graphs is NP-hard
- Multiplicative vertex-colouring weightings of graphs
- Sigma partitioning: complexity and random graphs
- A note on vertex colorings of plane graphs
- Topological additive numbering of directed acyclic graphs
- e-lucky labeling of certain graphs
- Upper bounds on distance vertex irregularity strength of some families of graphs
- Graphs with multiplicative vertex-coloring 2-edge-weightings
- Magic sigma coloring of a graph
- An Alon-Tarsi style theorem for additive colorings
- Graphs connected to isotopes of inverse property quasigroups: a few applications
- Proper additive choice number of planar graphs
- Introduction to majority additive coloring
- Additive coloring of planar graphs
- Coloring chip configurations on graphs and digraphs
This page was built for publication: Lucky labelings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989579)
