%0 Journal Article %1 journals/jco/AhadiDS17 %A Ahadi, Arash %A Dehghan, Ali %A Saghafian, Morteza %D 2017 %J J. Comb. Optim. %K dblp %N 3 %P 760-770 %T Is there any polynomial upper bound for the universal labeling of graphs? %U http://dblp.uni-trier.de/db/journals/jco/jco34.html#AhadiDS17 %V 34

@article{journals/jco/AhadiDS17, added-at = {2023-09-30T00:00:00.000+0200}, author = {Ahadi, Arash and Dehghan, Ali and Saghafian, Morteza}, biburl = {https://www.bibsonomy.org/bibtex/284c1762727ebf48830d0ddca8e1ac298/dblp}, ee = {https://doi.org/10.1007/s10878-016-0107-8}, interhash = {34879eae3892f9bf1d76530e606efea7}, intrahash = {84c1762727ebf48830d0ddca8e1ac298}, journal = {J. Comb. Optim.}, keywords = {dblp}, number = 3, pages = {760-770}, timestamp = {2024-04-09T06:56:01.000+0200}, title = {Is there any polynomial upper bound for the universal labeling of graphs?}, url = {http://dblp.uni-trier.de/db/journals/jco/jco34.html#AhadiDS17}, volume = 34, year = 2017 }