{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:29Z","timestamp":1740122429044,"version":"3.37.3"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T00:00:00Z","timestamp":1436572800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["No. NRF-2010-0009933"],"award-info":[{"award-number":["No. NRF-2010-0009933"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["No. NRF-2010-0009933"],"award-info":[{"award-number":["No. NRF-2010-0009933"]}],"id":[{"id":"10.13039\/501100003725","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-9928-0","type":"journal-article","created":{"date-parts":[[2015,7,10]],"date-time":"2015-07-10T11:00:49Z","timestamp":1436526049000},"page":"13-27","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On consecutive edge magic total labelings of connected bipartite graphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Bumtle","family":"Kang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Suh-Ryung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji Yeon","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,7,11]]},"reference":[{"issue":"2","key":"9928_CR1","doi-asserted-by":"crossref","first-page":"105","DOI":"10.55937\/sut\/991985322","volume":"34","author":"H Enomoto","year":"1998","unstructured":"Enomoto H, Llad\u00f3 AS, Nakamigawa T, Ringel G (1998) Super edge-magic graphs. SUT J Math 34(2):105\u2013109","journal-title":"SUT J Math"},{"key":"9928_CR2","first-page":"1","volume":"17","author":"JA Gallian","year":"2014","unstructured":"Gallian JA (2014) A dynamic survey of graph labeling. Electron J Comb 17:1\u2013384","journal-title":"Electron J Comb"},{"key":"9928_CR3","first-page":"113","volume":"81","author":"S-R Kim","year":"2006","unstructured":"Kim S-R, Park JY (2006) On super edge-magic graphs. Ars Comb 81:113\u2013127","journal-title":"Ars Comb"},{"key":"9928_CR4","doi-asserted-by":"crossref","first-page":"451","DOI":"10.4153\/CMB-1970-084-1","volume":"13","author":"A Kotzig","year":"1970","unstructured":"Kotzig A, Rosa A (1970) Magic valuations of finite graphs. Can Math Bull 13:451\u2013461","journal-title":"Can Math Bull"},{"key":"9928_CR5","volume-title":"Magic graphs","author":"AM Marr","year":"2014","unstructured":"Marr AM, Wallis WD (2014) Magic graphs. Springer, New York"},{"key":"9928_CR6","first-page":"83","volume":"18","author":"G Ringel","year":"1996","unstructured":"Ringel G, Llad\u00f3 A (1996) Another tree conjecture. Bull Inst Comb Appl 18:83\u201385","journal-title":"Bull Inst Comb Appl"},{"key":"9928_CR7","unstructured":"Sedl\u00e1c\u0306ek J (1963) Problem 27. Theory of graphs and its applications. In: Proceedings of symposium smolenice, pp 163\u2013167"},{"key":"9928_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.jda.2006.05.003","volume":"6","author":"KA Sugeng","year":"2008","unstructured":"Sugeng KA, Miller M (2008) On consecutive edge magic total labelings of graphs. J Discret Algorithms 6:59\u201365","journal-title":"J Discret Algorithms"},{"key":"9928_CR9","volume-title":"An introduction to graph theory","author":"DB West","year":"1996","unstructured":"West DB (1996) An introduction to graph theory. Prentice-Hall, New York"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9928-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9928-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9928-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9928-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,12]],"date-time":"2023-08-12T04:38:41Z","timestamp":1691815121000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9928-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,11]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["9928"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9928-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2015,7,11]]}}}