{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:12:39Z","timestamp":1758823959644},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,9,25]],"date-time":"2015-09-25T00:00:00Z","timestamp":1443139200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s00373-015-1633-3","type":"journal-article","created":{"date-parts":[[2015,9,25]],"date-time":"2015-09-25T07:47:07Z","timestamp":1443167227000},"page":"1203-1216","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Total Weight Choosability of Cone Graphs"],"prefix":"10.1007","volume":"32","author":[{"given":"Yunfang","family":"Tang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsai-Lien","family":"Wong","sequence":"additional","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,9,25]]},"reference":[{"key":"1633_CR1","doi-asserted-by":"crossref","unstructured":"Addario-Berry, L., Dalal, K., Reed, B.A.: Degree constrained subgraphs. In: Proceeding of GRACO2005, Electron. Notes Discrete Math., vol. 19, pp. 257\u2013263. Amsterdam, Elsevier (2005)","DOI":"10.1016\/j.endm.2005.05.035"},{"key":"1633_CR2","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, B.A., Thomason, A.: Vertex-colouring edge-weightings. Combinatorica 27, 1\u201312 (2007)","journal-title":"Combinatorica"},{"key":"1633_CR3","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1007\/BF02125351","volume":"9","author":"N Alon","year":"1989","unstructured":"Alon, N., Tarsi, M.: A nowhere zero point in linear mappings. Combinatorica 9, 393\u2013395 (1989)","journal-title":"Combinatorica"},{"key":"1633_CR4","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N Alon","year":"1999","unstructured":"Alon, N., Tarsi, M.: Combinatoria Nullstellensatz. Combin. Prob. Comput. 8, 7\u201329 (1999)","journal-title":"Combin. Prob. Comput."},{"key":"1633_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.: Weight choosability of graphs. J. Graph Theory 60, 242\u2013256 (2009)","journal-title":"J. Graph Theory"},{"key":"1633_CR6","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.: Vertex coloring edge-weightings: towards the 1-2-3 Conjecture. J. Combin. Theory. Ser. B 100, 347\u2013349 (2010)","journal-title":"J. Combin. Theory. Ser. B"},{"key":"1633_CR7","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.: Edge weights and vertex colour. J. Combin. Theory. Ser. B 91, 151\u2013157 (2004)","journal-title":"J. Combin. Theory. Ser. B"},{"issue":"1","key":"1633_CR8","doi-asserted-by":"crossref","first-page":"P112","DOI":"10.37236\/599","volume":"18","author":"J Przyby\u0142o","year":"2011","unstructured":"Przyby\u0142o, J., Wo\u017aniak, M.: Total weight choosability of graphs. Electron. J. Combin 18(1), P112 (2011)","journal-title":"Electron. J. Combin"},{"key":"1633_CR9","unstructured":"Kalkowski, M.: A note on 1,2-Conjecture. Electron. J. Combin. (2013) (submitted for publication)"},{"key":"1633_CR10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11461-008-0009-8","volume":"3","author":"T Wang","year":"2008","unstructured":"Wang, T., Yu, Q.L.: A note on vertex-coloring 13-edge-weighting. Front. Math. China 3, 1\u20137 (2008)","journal-title":"Front. Math. China"},{"key":"1633_CR11","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1007\/s10878-012-9491-x","volume":"25","author":"H Pan","year":"2013","unstructured":"Pan, H., Yang, D.: On total weight choosability of graphs. J. Combin. Optim 25, 766\u2013783 (2013)","journal-title":"J. Combin. Optim"},{"key":"1633_CR12","doi-asserted-by":"crossref","unstructured":"Wong, T., Yang, D., Zhu, X.: List total weighting of graphs. Fete of combinatorics and computer science. Bolyai society mathematical studies, vol. 20, pp. 337\u2013353. J\u00e1nos Bolyai Math Soc, Budapest","DOI":"10.1007\/978-3-642-13580-4_13"},{"key":"1633_CR13","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1002\/jgt.20500","volume":"66","author":"T Wong","year":"2011","unstructured":"Wong, T., Zhu, X.: Total Weight choosability of graphs. J. Graph Theory 66, 175\u2013259 (2011)","journal-title":"J. Graph Theory"},{"key":"1633_CR14","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.: Total weight choosability of Cartesian product of graphs. Eur. J. Combin. 33, 1725\u20131738 (2012)","journal-title":"Eur. J. Combin."},{"key":"1633_CR15","unstructured":"Wong, T., Zhu, X.: Permanent index of matrices associated with graphs. Manuscript (2013)"},{"key":"1633_CR16","doi-asserted-by":"crossref","unstructured":"Wong, T., Zhu, X.: Every graph is (2,3)-choosable. Combinatoria (2014). doi: 10.1007\/s00493-014-3057-8","DOI":"10.1007\/s00493-014-3057-8"},{"key":"1633_CR17","unstructured":"Wong, T., Zhu, X.: Total weight choosability of d-degenerate graphs. Manuscript (2013)"},{"key":"1633_CR18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1995","unstructured":"Mycielski, J.: Sur le colouring des graphs. Colloq. Math. 3, 161\u2013162 (1995)","journal-title":"Colloq. Math."},{"key":"1633_CR19","doi-asserted-by":"crossref","unstructured":"Tang, Y., Zhu, X.: Total Weight choosability of Mycielski graphs. J. Comb. Optim. (2015). doi: 10.1007\/s10878-015-9943-1","DOI":"10.1007\/s10878-015-9943-1"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1633-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1633-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1633-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,8]],"date-time":"2020-09-08T19:05:59Z","timestamp":1599591959000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1633-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,25]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["1633"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1633-3","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,25]]}}}