The following pages link to Lucky labelings of graphs (Q989579):
Displayed 5 items.
- 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)
- Coloring chip configurations on graphs and digraphs (Q763476) (← links)
- On the lucky choice number of graphs (Q1950410) (← links)