The following pages link to Lucky labelings of graphs (Q989579):
Displayed 24 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Computation of lucky number of planar graphs is NP-hard (Q413250) (← links)
- Multiplicative vertex-colouring weightings of graphs (Q413281) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Topological additive numbering of directed acyclic graphs (Q477623) (← links)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← links)
- Additive coloring of planar graphs (Q742621) (← links)
- Coloring chip configurations on graphs and digraphs (Q763476) (← links)
- Colourings of graphs by labellings (Q1687834) (← links)
- Graph coloring and Graham's greatest common divisor problem (Q1690244) (← links)
- On the lucky choice number of graphs (Q1950410) (← links)
- Upper bounds on inclusive distance vertex irregularity strength (Q2053732) (← links)
- A new approach on locally checkable problems (Q2127611) (← links)
- A note on additive choice number of planar graphs (Q2172418) (← links)
- Additive list coloring of planar graphs with given girth (Q2175242) (← links)
- On a total version of 1-2-3 conjecture (Q2194539) (← links)
- From the 1-2-3 conjecture to the Riemann hypothesis (Q2225418) (← links)
- A lower bound and several exact results on the \(d\)-lucky number (Q2284776) (← links)
- Planar graphs with girth 20 are additively 3-choosable (Q2306581) (← links)
- On the additive chromatic number of several families of graphs (Q2308457) (← links)
- The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$ (Q2958104) (← links)
- Upper bounds on distance vertex irregularity strength of some families of graphs (Q5089899) (← links)
- Magic sigma coloring of a graph (Q6179299) (← links)