{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T23:32:57Z","timestamp":1778715177680,"version":"3.51.4"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,1,26]],"date-time":"2013-01-26T00:00:00Z","timestamp":1359158400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s10878-012-9569-5","type":"journal-article","created":{"date-parts":[[2013,1,25]],"date-time":"2013-01-25T05:25:24Z","timestamp":1359091524000},"page":"893-909","source":"Crossref","is-referenced-by-count":8,"title":["Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five"],"prefix":"10.1007","volume":"28","author":[{"given":"Chengchao","family":"Yan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danjun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dong","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weifan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,1,26]]},"reference":[{"key":"9569_CR1","doi-asserted-by":"crossref","unstructured":"Balister PN, Gy\u0151ri E, Lehel J, Schelp RH (2007) Adjacent vertex distinguishing edge-colorings. SIAM J Discret Math 21:237\u2013250","DOI":"10.1137\/S0895480102414107"},{"key":"9569_CR2","doi-asserted-by":"crossref","first-page":"429","DOI":"10.7151\/dmgt.1556","volume":"31","author":"Y Bu","year":"2011","unstructured":"Bu Y, Lih K-W, Wang W (2011) Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. Discuss Math Graph Theory 31:429\u2013439","journal-title":"Discuss Math Graph Theory"},{"key":"9569_CR3","doi-asserted-by":"crossref","unstructured":"Edwards K, Horn\u030c\u00e1k M, Wo\u017aniak M (2006) On the neighbour-distinguishing index of a graph. Graphs Comb 22:341\u2013350","DOI":"10.1007\/s00373-006-0671-2"},{"key":"9569_CR4","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.jctb.2005.04.002","volume":"95","author":"H Hatami","year":"2005","unstructured":"Hatami H (2005) $$\\Delta + 300$$ is a bound on the adjacent vertex distinguishing edge chromatic number. J Comb Theory Ser B 95:246\u2013256","journal-title":"J Comb Theory Ser B"},{"key":"9569_CR5","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/j.endm.2011.09.074","volume":"38","author":"H Hocquard","year":"2011","unstructured":"Hocquard H, Montassier M (2011) Adjacent vertex-distinguishing edge coloring of graphs with maximum degree at least five. Electron Notes Discret Math 38:457\u2013462","journal-title":"Electron Notes Discret Math"},{"key":"9569_CR6","doi-asserted-by":"crossref","unstructured":"Hocquard H, Montassier M (2012) Adjacent vertex-distinguishing edge coloring of graphs with maximum degree $$\\Delta $$ . J Comb Optim. doi: 10.1007\/s10878-011-9444-9","DOI":"10.1007\/s10878-011-9444-9"},{"key":"9569_CR7","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing VG (1964) On an estimate of the chromatic class of a $$p$$ -graph. Diskret Anal 3:25\u201330","journal-title":"Diskret Anal"},{"key":"9569_CR8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10878-008-9178-5","volume":"19","author":"W Wang","year":"2010","unstructured":"Wang W, Wang Y (2010) Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. J Comb Optim 19:471\u2013485","journal-title":"J Comb Optim"},{"key":"9569_CR9","doi-asserted-by":"crossref","first-page":"2034","DOI":"10.1016\/j.aml.2011.05.038","volume":"24","author":"W Wang","year":"2011","unstructured":"Wang W, Wang Y (2011) Adjacent vertex distinguishing edge colorings of $$K_4$$ -minor free graphs. Appl Math Lett 24:2034\u20132037","journal-title":"Appl Math Lett"},{"key":"9569_CR10","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1016\/S0893-9659(02)80015-5","volume":"15","author":"Z Zhang","year":"2002","unstructured":"Zhang Z, Liu L, Wang J (2002) Adjacent strong edge coloring of graphs. Appl Math Lett 15:623\u2013626","journal-title":"Appl Math Lett"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9569-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-012-9569-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-012-9569-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:20Z","timestamp":1559276600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-012-9569-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,26]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["9569"],"URL":"https:\/\/doi.org\/10.1007\/s10878-012-9569-5","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1,26]]}}}