{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:29:53Z","timestamp":1758817793591,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T00:00:00Z","timestamp":1652659200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Fundacao de Amparo a Pesquisa do Estado de Sao Paulo","award":["2014\/16861-8"],"award-info":[{"award-number":["2014\/16861-8"]}]},{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cientifico e Tecnologico","doi-asserted-by":"publisher","award":["423833\/2018-9","422912\/2021-2"],"award-info":[{"award-number":["423833\/2018-9","422912\/2021-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s00373-022-02492-0","type":"journal-article","created":{"date-parts":[[2022,5,16]],"date-time":"2022-05-16T18:04:57Z","timestamp":1652724297000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Neighbour-Distinguishing Labellings of Families of Graphs"],"prefix":"10.1007","volume":"38","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"}]}],"member":"297","published-online":{"date-parts":[[2022,5,16]]},"reference":[{"issue":"2","key":"2492_CR1","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.jctb.2005.01.001","volume":"94","author":"L Addario-Berry","year":"2005","unstructured":"Addario-Berry, L., Aldred, R.E.L., Dalal, K., Reed, B.A.: Vertex colouring edge partitions. J. Comb. Theory Ser. B 94(2), 237\u2013244 (2005)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"2492_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00493-007-0041-6","volume":"27","author":"L Addario-Berry","year":"2007","unstructured":"Addario-Berry, L., Dalal, K., McDiarmid, C., Reed, B.A., Thomason, A.: Vertex-coloring edge-weightings. Combinatorica 27(1), 1\u201312 (2007)","journal-title":"Combinatorica"},{"key":"2492_CR3","unstructured":"Bensmail, J.: The vertex-colouring $$\\{a,b\\}$$-edge-weighting problem is NP-complete for every pair of weights. Technical report. University of Bordeaux, LABRI. (2013). https:\/\/hal.archives-ouvertes.fr\/hal-00826346\/document. Accessed 12 May 2022"},{"issue":"4","key":"2492_CR4","doi-asserted-by":"crossref","first-page":"1807","DOI":"10.11650\/twjm\/1500406380","volume":"15","author":"GJ Chang","year":"2011","unstructured":"Chang, G.J., Lu, C., Wu, J., Yu, Q.: Vertex-coloring edge-weightings of graphs. Taiwan. J. Math. 15(4), 1807\u20131813 (2011)","journal-title":"Taiwan. J. Math."},{"issue":"1","key":"2492_CR5","first-page":"67","volume":"17","author":"A Davoodi","year":"2015","unstructured":"Davoodi, A., Omoomi, B.: On the 1-2-3-conjecture. Discrete Math. Theor. Comput. Sci. 17(1), 67\u201378 (2015)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"3","key":"2492_CR6","first-page":"45","volume":"13","author":"A Dudek","year":"2011","unstructured":"Dudek, A., Wajc, D.: On the complexity of vertex-coloring edge-weightings. Discrete Math. Theor. Comput. Sci. 13(3), 45\u201350 (2011)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2492_CR7","first-page":"68","volume":"52","author":"H Escuadro","year":"2008","unstructured":"Escuadro, H., Okamoto, F., Zhang, P.: A three-color problem in graph theory. Bull. ICA 52, 68\u201382 (2008)","journal-title":"Bull. ICA"},{"issue":"4","key":"2492_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.: A relaxed case on 1-2-3 conjecture. Graphs Comb. 32(4), 1415\u20131421 (2016)","journal-title":"Graphs Comb."},{"issue":"6","key":"2492_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.: Vertex Coloring of Graphs by Total 2-Weightings. Graphs Comb. 32(6), 2461\u20132471 (2016)","journal-title":"Graphs Comb."},{"key":"2492_CR10","unstructured":"Kalkowski, M.: Metody algorytmiczne w badaniach si\u0142y nieregularno\u015bci graf\u00f3w. Ph.D. thesis, Uniwersytet im. Adama Mickiewicza, Wydzia\u0142 Matematyki i Informatyki (2010) (in Polish)"},{"issue":"3","key":"2492_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.: Vertex-coloring edge-weightings: toward the 1-2-3-conjecture. J. Comb. Theory Ser. B 100(3), 347\u2013349 (2010)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"2492_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.: Edge weights and vertex colours. J. Comb. Theory Ser. B 91(1), 151\u2013157 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"2492_CR13","first-page":"1","volume":"14","author":"M Khatirinejad","year":"2012","unstructured":"Khatirinejad, M., Naserasr, R., Newman, M., Seamone, B., Stevens, B.: Vertex-colouring edge-weightings with two edge weights. Discrete Math. Theor. Comput. Sci. 14(1), 1\u201320 (2012)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"1","key":"2492_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, C.Q.: Vertex-coloring 2-edge-weighting of graphs. Eur. J. Combin. 32(1), 21\u201327 (2011)","journal-title":"Eur. J. Combin."},{"key":"2492_CR15","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1016\/j.akcej.2016.06.008","volume":"13","author":"N Paramaguru","year":"2016","unstructured":"Paramaguru, N., Sampathkumar, R.: Graphs with vertex-coloring and detectable $$2$$-edge-weighting. AKCE Int. J. Graphs Comb. 13, 146\u2013156 (2016)","journal-title":"AKCE Int. J. Graphs Comb."},{"issue":"1","key":"2492_CR16","first-page":"101","volume":"12","author":"J Przyby\u0142o","year":"2010","unstructured":"Przyby\u0142o, J., Wo\u017aniak, M.: On a 1,2 conjecture. Discrete Math. Theor. Comput. Sci. 12(1), 101\u2013108 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"2492_CR17","unstructured":"Seymour, P.D.: Nowhere-zero flows. In: Graham, R.L., Grotschel, M., Lovasz, L. (eds.) Handbook of Combinatorics, pp. 289\u2013299. North-Holand, Amsterdam (1995)"},{"issue":"4","key":"2492_CR18","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1017\/S0370164600044229","volume":"10","author":"PG Tait","year":"1880","unstructured":"Tait, P.G.: Remarks on the colouring of maps. Proc. R. Soc. Edinb. 10(4), 501\u2013503 (1880)","journal-title":"Proc. R. Soc. Edinb."},{"key":"2492_CR19","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, C.Q.: The 3-flow conjecture, factors modulo k, and the 1\u20132-3-conjecture. J. Comb. Theory Ser. B 121, 308\u2013325 (2016). https:\/\/doi.org\/10.1016\/j.jctb.2016.06.010","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"2492_CR20","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1016\/j.disc.2017.12.001","volume":"341","author":"B Vu\u010dkovi\u0107","year":"2018","unstructured":"Vu\u010dkovi\u0107, B.: Multi-set neighbour-distinguishing 3-edge coloring. Discrete Math. 341(3), 820\u2013824 (2018)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02492-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-022-02492-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-022-02492-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,5]],"date-time":"2023-02-05T09:44:15Z","timestamp":1675590255000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-022-02492-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,16]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2492"],"URL":"https:\/\/doi.org\/10.1007\/s00373-022-02492-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2022,5,16]]},"assertion":[{"value":"22 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"95"}}