Is there any polynomial upper bound for the universal labeling of graphs?
Crossref DOI link: https://doi.org/10.1007/s10878-016-0107-8
Published Online: 2016-12-23
Published Print: 2017-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ahadi, Arash
Dehghan, Ali
Saghafian, Morteza
License valid from 2016-12-23