{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T07:44:55Z","timestamp":1780386295595,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,5,22]],"date-time":"2013-05-22T00:00:00Z","timestamp":1369180800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10878-013-9628-6","type":"journal-article","created":{"date-parts":[[2013,5,21]],"date-time":"2013-05-21T02:28:01Z","timestamp":1369103281000},"page":"1-17","source":"Crossref","is-referenced-by-count":7,"title":["Group irregularity strength of connected graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Marcin","family":"Anholcer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sylwia","family":"Cichacz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Milanic\u0306","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,5,22]]},"reference":[{"issue":"4","key":"9628_CR1","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1137\/0403038","volume":"3","author":"M Aigner","year":"1990","unstructured":"Aigner M, Triesch E (1990) Irregular assignments of trees and forests. SIAM J Discret Math 3(4):439\u2013449","journal-title":"SIAM J Discret Math"},{"key":"9628_CR2","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/S0012-365X(98)00112-5","volume":"190","author":"D Amar","year":"1998","unstructured":"Amar D, Togni O (1998) Irregularity strength of trees. Discret Math 190:15\u201338","journal-title":"Discret Math"},{"key":"9628_CR3","unstructured":"Anholcer M, Cichacz S (2013) Group sum chromatic number of graphs, preprint, arXiv:1205.2572v3 [math.CO]"},{"key":"9628_CR4","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0097-3165(91)90034-E","volume":"56","author":"R Beals","year":"1991","unstructured":"Beals R, Gallian J, Headley P, Jungreis D (1991) Harmonious groups. J Combin Theory Ser A 56:223\u2013238","journal-title":"J Combin Theory Ser A"},{"key":"9628_CR5","first-page":"19","volume":"R92","author":"N Cavenagh","year":"2006","unstructured":"Cavenagh N, Combe D, Nelson AM (2006) dge-magic group labellings of countable graphs. Electron J Combin R92:19","journal-title":"Electron J Combin"},{"key":"9628_CR6","first-page":"187","volume":"64","author":"G Chartrand","year":"1988","unstructured":"Chartrand G, Jacobson MS, Lehel J, Oellermann OR, Ruiz S, Saba F (1988) Irregular networks. Congressus Numerantium 64:187\u2013192","journal-title":"Congressus Numerantium"},{"key":"9628_CR7","first-page":"259","volume":"29","author":"D Combe","year":"2004","unstructured":"Combe D, Nelson AM, Palmer WD (2004) Magic labellings of graphs over finite Abelian groups. Aust J Combin 29:259\u2013271","journal-title":"Aust J Combin"},{"key":"9628_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J Edmonds","year":"1965","unstructured":"Edmonds J (1965) Maximum matching and a polyhedron with 0,1-Vertices. J Res Nat Bureau Stand 69B:125\u2013130","journal-title":"J Res Nat Bureau Stand"},{"key":"9628_CR9","unstructured":"Froncek D (2013) Group distance magic labeling of Cartesian products of cycles. Austral J Comp 55:167\u2013174."},{"key":"9628_CR10","doi-asserted-by":"crossref","first-page":"1189","DOI":"10.1016\/j.dam.2010.02.003","volume":"158","author":"M Ferrara","year":"2010","unstructured":"Ferrara M, Gould RJ, Karo\u0144ski M, Pfender F (2010) An iterative approach to graph irregularity strength. Discret Appl Math 158:1189\u20131194","journal-title":"Discret Appl Math"},{"key":"9628_CR11","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1137\/0601045","volume":"1","author":"RL Graham","year":"1980","unstructured":"Graham RL, Sloane NJA (1980) On additive bases and harmonious graphs. SIAM J Algebraic Discret Methods 1:382\u2013404","journal-title":"SIAM J Algebraic Discret Methods"},{"key":"9628_CR12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0012-365X(91)90254-Y","volume":"93","author":"M Hovey","year":"1991","unstructured":"Hovey M (1991) $$A$$ A -cordial graphs. Discret Math 93:183\u2013194","journal-title":"Discret Math"},{"key":"9628_CR13","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1137\/090774112","volume":"25","author":"M Kalkowski","year":"2011","unstructured":"Kalkowski M, Karo\u0144ski M, Pfender F (2011) A new upper bound for the irregularity strength of graphs. SIAM J Discret Math 25:1319\u20131321","journal-title":"SIAM J Discret Math"},{"key":"9628_CR14","doi-asserted-by":"crossref","first-page":"2010","DOI":"10.1016\/j.disc.2008.04.012","volume":"309","author":"G Kaplan","year":"2009","unstructured":"Kaplan G, Lev A, Roditty Y (2009) On zero-sum partitions and anti-magic trees. Discret Math 309:2010\u20132014","journal-title":"Discret Math"},{"key":"9628_CR15","first-page":"167","volume":"572","author":"P Mih\u01ceilescu","year":"2004","unstructured":"Mih\u01ceilescu P (2004) Primary cyclotomic units and a proof of Catalan\u2019s Conjecture. Journal f\u00fcr die reine und angewandte Mathematik 572:167\u2013195","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"9628_CR16","doi-asserted-by":"crossref","unstructured":"Majerski P, Przyby\u0142o J (2013) On the irregularity strength of dense graphs (submitted)","DOI":"10.1002\/jgt.21748"},{"key":"9628_CR17","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1215\/S0012-7094-73-04054-4","volume":"40","author":"RP Stanley","year":"1973","unstructured":"Stanley RP (1973) Linear homogeneous Diophantine equations and magic labelings of graphs. Duke Math J 40:607\u2013632","journal-title":"Duke Math J"},{"key":"9628_CR18","unstructured":"Togni O. (1998) Force des graphes. Indice optique des r\u00e9seaux, Th\u00e8se pr\u00e9sent\u00e9e pour obtenir le grade de docteur, Universit\u00e9 de Bordeaux 1, \u00c9cole doctorale de mathematiques et d\u2019informatique 141."},{"key":"9628_CR19","doi-asserted-by":"crossref","first-page":"6055","DOI":"10.1016\/j.disc.2009.05.010","volume":"309","author":"A \u017bak","year":"2009","unstructured":"\u017bak A (2009) Harmonious orders of graphs. Discret Math 309:6055\u20136064","journal-title":"Discret Math"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9628-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9628-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9628-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,13]],"date-time":"2019-07-13T20:20:13Z","timestamp":1563049213000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9628-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,22]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["9628"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9628-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,22]]}}}