{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T22:00:21Z","timestamp":1761861621087},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,12,23]],"date-time":"2016-12-23T00:00:00Z","timestamp":1482451200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10878-016-0107-8","type":"journal-article","created":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T20:33:12Z","timestamp":1482611592000},"page":"760-770","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Is there any polynomial upper bound for the universal labeling of graphs?"],"prefix":"10.1007","volume":"34","author":[{"given":"Arash","family":"Ahadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Dehghan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morteza","family":"Saghafian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,23]]},"reference":[{"issue":"19\u201321","key":"107_CR1","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1016\/j.ipl.2013.07.017","volume":"113","author":"A Ahadi","year":"2013","unstructured":"Ahadi A, Dehghan A (2013) The complexity of the proper orientation number. Inf Process Lett 113(19\u201321):799\u2013803","journal-title":"Inf Process Lett"},{"issue":"3","key":"107_CR2","first-page":"217","volume":"17","author":"A Ahadi","year":"2016","unstructured":"Ahadi A, Dehghan A (2016) The inapproximability for the (0,1)-additive number. Discrete Math Theor Comput Sci 17(3):217\u2013226","journal-title":"Discrete Math Theor Comput Sci"},{"key":"107_CR3","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.tcs.2014.11.037","volume":"566","author":"J Araujo","year":"2015","unstructured":"Araujo J, Cohen N, de Rezende SF, Havet F, Moura PFS (2015) On the proper orientation number of bipartite graphs. Theor Comput Sci 566:59\u201375","journal-title":"Theor Comput Sci"},{"key":"107_CR4","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.tcs.2016.05.016","volume":"639","author":"J Araujo","year":"2016","unstructured":"Araujo J, Havet F, Linhares Sales C, Silva A (2016) Proper orientation of cacti. Theor Comput Sci 639:14\u201325","journal-title":"Theor Comput Sci"},{"key":"107_CR5","unstructured":"Dehghan A (2014) The universal labeling of graph. Mathoverflow. \n                        http:\/\/mathoverflow.net\/questions\/169045\/the-universal-labeling-of-graph"},{"key":"107_CR6","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1016\/j.tcs.2013.05.027","volume":"495","author":"A Dehghan","year":"2013","unstructured":"Dehghan A, Sadeghi M-R, Ahadi A (2013) Algorithmic complexity of proper labeling problems. Theor Comput Sci 495:25\u201336","journal-title":"Theor Comput Sci"},{"issue":"3","key":"107_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.jctb.2009.06.002","volume":"100","author":"M Kalkowski","year":"2010","unstructured":"Kalkowski M, Karo\u0144ski M, Pfender F (2010) Vertex-coloring edge-weightings: towards the 1-2-3-conjecture. J Combin Theory Ser B 100(3):347\u2013349","journal-title":"J Combin Theory Ser B"},{"issue":"1","key":"107_CR8","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jctb.2003.12.001","volume":"91","author":"M Karo\u0144ski","year":"2004","unstructured":"Karo\u0144ski M, \u0141uczak T, Thomason A (2004) Edge weights and vertex colours. J Combin Theory Ser B 91(1):151\u2013157","journal-title":"J Combin Theory Ser B"},{"issue":"1","key":"107_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0196-6774(83)90032-9","volume":"4","author":"D Leven","year":"1983","unstructured":"Leven D, Galil Z (1983) NP-completeness of finding the chromatic index of regular graphs. J Algorithms 4(1):35\u201344","journal-title":"J Algorithms"},{"key":"107_CR10","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing VG (1964) On an estimate of the chromatic class of a \n                        $$p$$\n                        \n                            \n                                            \n                                p\n                            \n                        \n                    -graph. Diskret Analiz 3:25\u201330","journal-title":"Diskret Analiz"},{"key":"107_CR11","volume-title":"Introduction to graph theory","author":"DB West","year":"1996","unstructured":"West DB (1996) Introduction to graph theory. Prentice Hall Inc., Upper Saddle River, NJ"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-0107-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0107-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-0107-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,21]],"date-time":"2017-09-21T12:35:15Z","timestamp":1505997315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-0107-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,23]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["107"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-0107-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,23]]}}}