Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference7 articles.
1. Computation of lucky number of planar graphs is NP-hard;Ahadi;Inf. Process. Lett.,2012
2. On the lucky choice number of graphs;Akbari;Graphs Comb.,2013
3. Additive colorings of planar graphs;Bartnicki;Graphs Comb.,2014
4. Additive list coloring of planar graphs with given girth;Brandt;Discuss. Math., Graph Theory,2020
5. Lucky labelings of graphs;Czerwiński;Inf. Process. Lett.,2009
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献