Pages that link to "Item:Q1950410"
From MaRDI portal
The following pages link to On the lucky choice number of graphs (Q1950410):
Displayed 9 items.
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- On \(k\)-edge-magic labelings of maximal outerplanar graphs (Q896094) (← 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)
- 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)
- (Q5076575) (← links)