{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:00Z","timestamp":1740122400209,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T00:00:00Z","timestamp":1581984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T00:00:00Z","timestamp":1581984000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001807","name":"FAPESP","doi-asserted-by":"crossref","award":["2014\/16861-8","2014\/16987-1"],"award-info":[{"award-number":["2014\/16861-8","2014\/16987-1"]}],"id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004586","name":"FAPERJ","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100004586","id-type":"DOI","asserted-by":"crossref"}]},{"name":"CAPES\/MathAmSud","award":["021\/14"],"award-info":[{"award-number":["021\/14"]}]},{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"crossref","award":["425340\/2016-3"],"award-info":[{"award-number":["425340\/2016-3"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s10878-020-00540-0","type":"journal-article","created":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T06:03:06Z","timestamp":1582005786000},"page":"1038-1059","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Neighbour-distinguishing labellings of powers of paths and powers of cycles"],"prefix":"10.1007","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6177-403X","authenticated-orcid":false,"given":"At\u00edlio G.","family":"Luiz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. N.","family":"Campos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"Dantas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Diana","family":"Sasaki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,18]]},"reference":[{"issue":"7","key":"540_CR1","doi-asserted-by":"publisher","first-page":"1168","DOI":"10.1016\/j.dam.2007.05.059","volume":"156","author":"L Addario-Berry","year":"2008","unstructured":"Addario-Berry L, Dalal K, Reed BA (2008) Degree constrained subgraphs. Discrete Appl Math 156(7):1168\u20131174","journal-title":"Discrete Appl Math"},{"key":"540_CR2","unstructured":"Bensmail J (2014) Partitions et d\u00e9compositions de graphes. Ph.D. thesis, \u00c9cole Doctorale de Math\u00e9matiques et Informatique de Bordeaux, Universit\u00e9 de Bordeaux, Bordeaux, France"},{"issue":"4","key":"540_CR3","doi-asserted-by":"publisher","first-page":"1807","DOI":"10.11650\/twjm\/1500406380","volume":"15","author":"GJ Chang","year":"2011","unstructured":"Chang GJ, Lu C, Wu J, Yu Q (2011) Vertex-coloring edge-weightings of graphs. Taiwan J Math 15(4):1807\u20131813","journal-title":"Taiwan J Math"},{"key":"540_CR4","first-page":"197","volume":"64","author":"G Chartrand","year":"1988","unstructured":"Chartrand G, Jacobson MS, Lehel J, Oellermann OR, Ruiz S, Saba F (1988) Irregular networks. Congr Numer 64:197\u2013210","journal-title":"Congr Numer"},{"issue":"1","key":"540_CR5","first-page":"67","volume":"17","author":"A Davoodi","year":"2015","unstructured":"Davoodi A, Omoomi B (2015) On the 1-2-3-conjecture. Discrete Math Theor Comput Sci 17(1):67\u201378","journal-title":"Discrete Math Theor Comput Sci"},{"issue":"3","key":"540_CR6","first-page":"45","volume":"13","author":"A Dudek","year":"2011","unstructured":"Dudek A, Wajc D (2011) On the complexity of vertex-coloring edge-weightings. Discrete Math Theor Comput Sci 13(3):45\u201350","journal-title":"Discrete Math Theor Comput Sci"},{"key":"540_CR7","unstructured":"Escuadro H, Okamoto F, Zhang P (2006) Circulants and a three-color conjecture. In: Proceedings of the 37th Southeastern international conference on combinatorics, graph theory and computing. Congressus Numerantium, vol 178, pp 33\u201355"},{"issue":"4","key":"540_CR8","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1007\/s00373-015-1656-9","volume":"32","author":"Y Gao","year":"2016","unstructured":"Gao Y, Wang G, Wu J (2016) A relaxed case on 1-2-3 conjecture. Graphs Comb 32(4):1415\u20131421","journal-title":"Graphs Comb"},{"issue":"6","key":"540_CR9","doi-asserted-by":"publisher","first-page":"2461","DOI":"10.1007\/s00373-016-1712-0","volume":"32","author":"J Hulgan","year":"2016","unstructured":"Hulgan J, Lehel J, Ozeki K, Yoshimoto K (2016) Vertex coloring of graphs by total 2-weightings. Graphs Comb 32(6):2461\u20132471","journal-title":"Graphs Comb"},{"key":"540_CR10","unstructured":"Kalkowski M (2010) Metody algorytmiczne w badaniach sily nieregularno\u015bci graf\u00f3w. Ph.D. thesis, Wydzia\u0142Matematyki i Informatyki, Uniwersytet im. Adama Mickiewicza (in Polish)"},{"issue":"3","key":"540_CR11","doi-asserted-by":"publisher","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 Comb Theory Ser B 100(3):347\u2013349","journal-title":"J Comb Theory Ser B"},{"issue":"1","key":"540_CR12","doi-asserted-by":"publisher","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 Comb Theory Ser B 91(1):151\u2013157","journal-title":"J Comb Theory Ser B"},{"issue":"1","key":"540_CR13","first-page":"1","volume":"14","author":"M Khatirinejad","year":"2012","unstructured":"Khatirinejad M, Naserasr R, Newman M, Seamone B, Stevens B (2012) Vertex-colouring edge-weightings with two edge weights. Discrete Math Theor Comput Sci 14(1):1\u201320","journal-title":"Discrete Math Theor Comput Sci"},{"issue":"1","key":"540_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ejc.2010.08.002","volume":"32","author":"H Lu","year":"2011","unstructured":"Lu H, Yu Q, Zhang CQ (2011) Vertex-coloring 2-edge-weighting of graphs. Eur J Comb 32(1):21\u201327","journal-title":"Eur J Comb"},{"issue":"3","key":"540_CR15","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1007\/s00373-013-1399-4","volume":"31","author":"M Pil\u015bniak","year":"2015","unstructured":"Pil\u015bniak M, Wo\u017aniak M (2015) On the total-neighbor-distinguishing index by sums. Graphs Comb 31(3):771\u2013782","journal-title":"Graphs Comb"},{"issue":"1","key":"540_CR16","first-page":"101","volume":"12","author":"J Przyby\u0142o","year":"2010","unstructured":"Przyby\u0142o J, Wo\u017aniak M (2010) On a 1, 2 conjecture. Discrete Math Theor Comput Sci 12(1):101\u2013108","journal-title":"Discrete Math Theor Comput Sci"},{"issue":"3\u20134","key":"540_CR17","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/j.ipl.2008.01.006","volume":"107","author":"J Skowronek-Kazi\u00f3w","year":"2008","unstructured":"Skowronek-Kazi\u00f3w J (2008) 1,2 conjecture\u2014the multiplicative version. Inf Process Lett 107(3\u20134):93\u201395","journal-title":"Inf Process Lett"},{"key":"540_CR18","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/j.jctb.2016.06.010","volume":"121","author":"C Thomassen","year":"2016","unstructured":"Thomassen C, Wu Y, Zhang CQ (2016) The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture. J Comb Theory Ser B 121:308\u2013325","journal-title":"J Comb Theory Ser B"},{"issue":"5","key":"540_CR19","doi-asserted-by":"publisher","first-page":"1789","DOI":"10.1007\/s00373-014-1479-0","volume":"31","author":"G Wang","year":"2015","unstructured":"Wang G, Yan G (2015) An improved upper bound on edge weight choosability of graphs. Graphs Comb 31(5):1789\u20131793","journal-title":"Graphs Comb"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00540-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-020-00540-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-020-00540-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T05:27:12Z","timestamp":1613712432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-020-00540-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,18]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["540"],"URL":"https:\/\/doi.org\/10.1007\/s10878-020-00540-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2020,2,18]]},"assertion":[{"value":"18 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}