{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T02:16:35Z","timestamp":1740104195024,"version":"3.37.3"},"reference-count":12,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:00:00Z","timestamp":1480464000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/doi.wiley.com\/10.1002\/tdm_license_1"},{"start":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T00:00:00Z","timestamp":1480464000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions"}],"funder":[{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["276726"],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Graph Theory"],"published-print":{"date-parts":[[2017,7]]},"DOI":"10.1002\/jgt.22100","type":"journal-article","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T08:59:31Z","timestamp":1480496371000},"page":"706-715","source":"Crossref","is-referenced-by-count":8,"title":["The 1-2-3-Conjecture for Hypergraphs"],"prefix":"10.1002","volume":"85","author":[{"given":"Maciej","family":"Kalkowski","sequence":"first","affiliation":[{"name":"FACULTY OF MATHEMATICS AND COMPUTER SCIENCE; ADAM MICKIEWICZ UNIVERSITY; POZNA\u0143 POLAND"}]},{"given":"Micha\u0142","family":"Karo\u0144ski","sequence":"additional","affiliation":[{"name":"FACULTY OF MATHEMATICS AND COMPUTER SCIENCE; ADAM MICKIEWICZ UNIVERSITY; POZNA\u0143 POLAND"},{"name":"DEPARTMENT OF MATHEMATICS AND COMPUTER SCIENCE; EMORY UNIVERSITY; ATLANTA GA"}]},{"given":"Florian","family":"Pfender","sequence":"additional","affiliation":[{"name":"DEPARTMENT OF MATHEMATICAL AND STATISTICAL SCIENCES; UNIVERSITY OF COLORADO DENVER; DENVER CO"}]}],"member":"311","published-online":{"date-parts":[[2016,11,30]]},"reference":[{"key":"10.1002\/jgt.22100-BIB0001|jgt22100-cit-0001","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","article-title":"Combinatorial Nullstellensatz","volume":"8","author":"Alon","year":"1999","journal-title":"Combin Prob Comput"},{"key":"10.1002\/jgt.22100-BIB0002|jgt22100-cit-0002","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1002\/jgt.20354","article-title":"Weight choosability of graphs","volume":"60","author":"Bartnicki","year":"2009","journal-title":"J Graph Theory"},{"key":"10.1002\/jgt.22100-BIB0003|jgt22100-cit-0003","doi-asserted-by":"crossref","DOI":"10.37236\/5709","article-title":"Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs","volume":"23","author":"Bennett","year":"2016","journal-title":"Electron. J. Combin"},{"key":"10.1002\/jgt.22100-BIB0004|jgt22100-cit-0004","first-page":"187","article-title":"Irregular networks","volume":"64","author":"Chartrand","year":"1988","journal-title":"Congressus Numerantium"},{"key":"10.1002\/jgt.22100-BIB0005|jgt22100-cit-0005","doi-asserted-by":"crossref","unstructured":"M. Kalkowski A note on the 1,2-conjecture 2009","DOI":"10.5771\/9783845268019-1"},{"key":"10.1002\/jgt.22100-BIB0006|jgt22100-cit-0006","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.jctb.2009.06.002","article-title":"Vertex-coloring edge-weightings: towards the 1-2-3 conjecture","volume":"100","author":"Kalkowski","year":"2010","journal-title":"J Combin Theory B"},{"key":"10.1002\/jgt.22100-BIB0007|jgt22100-cit-0007","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.jctb.2003.12.001","article-title":"Edge weights and vertex colours","volume":"91","author":"Karo\u0144ski","year":"2004","journal-title":"J Combin Theory B"},{"key":"10.1002\/jgt.22100-BIB0008|jgt22100-cit-0008","first-page":"101","article-title":"On a 1-2 conjecture","volume":"12","author":"Przyby\u0142o","year":"2010","journal-title":"Discrete Math Theoret Comput Sci"},{"key":"10.1002\/jgt.22100-BIB0009|jgt22100-cit-0009","doi-asserted-by":"crossref","DOI":"10.37236\/599","article-title":"Total weight choosability of graphs","volume":"18","author":"Przyby\u0142o","year":"2011","journal-title":"Electron J Combin"},{"key":"10.1002\/jgt.22100-BIB0010|jgt22100-cit-0010","first-page":"218","article-title":"The even cycle problem for directed graphs","volume":"5","author":"Thomassen","year":"1992","journal-title":"J AMS"},{"key":"10.1002\/jgt.22100-BIB0011|jgt22100-cit-0011","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1002\/jgt.20500","article-title":"Total weight choosability of graphs","volume":"66","author":"Wong","year":"2011","journal-title":"J Graph Theory"},{"key":"10.1002\/jgt.22100-BIB0012|jgt22100-cit-0012","first-page":"1","article-title":"Every graph is (2,3)-choosable","author":"Zhu","year":"2014","journal-title":"Combinatorica"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.22100","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.22100","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/full\/10.1002\/jgt.22100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T07:30:49Z","timestamp":1625470249000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.22100"}},"subtitle":["THE 1-2-3 CONJECTURE FOR HYPERGRAPHS"],"short-title":[],"issued":{"date-parts":[[2016,11,30]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,7]]}},"URL":"https:\/\/doi.org\/10.1002\/jgt.22100","archive":["Portico"],"relation":{},"ISSN":["0364-9024"],"issn-type":[{"type":"print","value":"0364-9024"}],"subject":[],"published":{"date-parts":[[2016,11,30]]}}}