The following pages link to Lucky labelings of graphs (Q989579):
Displayed 13 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)
- The Sigma Chromatic Number of the Circulant Graphs $$C_n(1,2)$$ , $$C_n(1,3)$$ , and $$C_{2n}(1,n)$$ (Q2958104) (← links)