{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T01:01:16Z","timestamp":1778720476626,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T00:00:00Z","timestamp":1439510400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China (CN)","doi-asserted-by":"publisher","award":["11171310"],"award-info":[{"award-number":["11171310"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2017,1]]},"DOI":"10.1007\/s10878-015-9943-1","type":"journal-article","created":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T01:55:29Z","timestamp":1439430929000},"page":"165-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Total weight choosability of Mycielski graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Yunfang","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuding","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,14]]},"reference":[{"key":"9943_CR1","doi-asserted-by":"crossref","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 BA, Thomason A (2007) Vertex-colouring edge-weightings. Combinatorica 27:1\u201312","journal-title":"Combinatorica"},{"issue":"7","key":"9943_CR2","doi-asserted-by":"crossref","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":"9943_CR3","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon N (1999) Combinatorial Nullstellensatz. Combin Probab Comput 8:7\u201329","journal-title":"Combin Probab Comput"},{"key":"9943_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF01204715","volume":"12","author":"N Alon","year":"1992","unstructured":"Alon N, Tarsi M (1992) Colorings and orientations of graphs. Combinatorica 12:125\u2013134","journal-title":"Combinatorica"},{"key":"9943_CR5","doi-asserted-by":"crossref","first-page":"242","DOI":"10.1002\/jgt.20354","volume":"60","author":"T Bartnicki","year":"2009","unstructured":"Bartnicki T, Grytczuk J, Niwczyk S (2009) Weight choosability of graphs. J Graph Theory 60:242\u2013256","journal-title":"J Graph Theory"},{"key":"9943_CR6","unstructured":"Kalkowski M (2009) A note on the 1,2-conjecture. Personal communication via Grytczuk"},{"issue":"3","key":"9943_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"},{"key":"9943_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:151\u2013157","journal-title":"J Combin Theory Ser B"},{"key":"9943_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/599","volume":"18","author":"J Przyby\u0142o","year":"2011","unstructured":"Przyby\u0142o J, Wo\u017aniak M (2011) Total weight choosability of graphs. Electron J Combin 18:1","journal-title":"Electron J Combin"},{"key":"9943_CR10","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/s11464-008-0041-x","volume":"3","author":"T Wang","year":"2008","unstructured":"Wang T, Yu QL (2008) On vertex-coloring 13-edge-weighting. Front Math China 3:581\u2013587","journal-title":"Front Math China"},{"key":"9943_CR11","doi-asserted-by":"crossref","first-page":"1725","DOI":"10.1016\/j.ejc.2012.04.004","volume":"33","author":"T Wong","year":"2012","unstructured":"Wong T, Wu J, Zhu X (2012) Total weight choosability of Cartesian product of graphs. Eur J Combin 33:1725\u20131738","journal-title":"Eur J Combin"},{"key":"9943_CR12","doi-asserted-by":"crossref","unstructured":"Wong T, Yang D, Zhu X (2010) List total weighting of graphs. Fete of combinatorics and computer science, vol 20. Bolyai Society Mathematical Studies, Budapest, pp 337\u2013353","DOI":"10.1007\/978-3-642-13580-4_13"},{"key":"9943_CR13","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1002\/jgt.20500","volume":"66","author":"T Wong","year":"2011","unstructured":"Wong T, Zhu X (2011) Total weight choosability of graphs. J Graph Theory 66:198\u2013212","journal-title":"J Graph Theory"},{"key":"9943_CR14","unstructured":"Wong T, Zhu X (2014) Permanent index of matrices associated with graphs. Manuscript"},{"key":"9943_CR15","doi-asserted-by":"publisher","unstructured":"Wong T, Zhu X (2014) Every graph is (2,3)-choosable. Combinatorica. doi: 10.1007\/s00493-014-3057-8","DOI":"10.1007\/s00493-014-3057-8"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9943-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9943-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9943-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9943-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,7]],"date-time":"2020-09-07T04:28:41Z","timestamp":1599452921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9943-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,14]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9943"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9943-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,14]]}}}