On the lucky choice number of graphs
From MaRDI portal
Publication:1950410
DOI10.1007/s00373-011-1112-4zbMath1379.05094OpenAlexW2096366037MaRDI QIDQ1950410
R. Manaviyat, Maryam Ghanbari, Saieed Akbari, Sanaz Zare
Publication date: 13 May 2013
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-011-1112-4
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (9)
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 ⋮ Algorithmic complexity of proper labeling problems ⋮ On \(k\)-edge-magic labelings of maximal outerplanar graphs ⋮ Unnamed Item ⋮ 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
Cites Work
This page was built for publication: On the lucky choice number of graphs
