{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T22:43:25Z","timestamp":1769208205564,"version":"3.49.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,9,26]],"date-time":"2014-09-26T00:00:00Z","timestamp":1411689600000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10878-014-9796-z","type":"journal-article","created":{"date-parts":[[2014,9,25]],"date-time":"2014-09-25T01:48:57Z","timestamp":1411609737000},"page":"874-880","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Yi","family":"Wang","sequence":"first","affiliation":[]},{"given":"Jian","family":"Cheng","sequence":"additional","affiliation":[]},{"given":"Rong","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Gregory","family":"Mulley","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,9,26]]},"reference":[{"key":"9796_CR1","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1137\/S0895480102414107","volume":"21","author":"PN Balister","year":"2007","unstructured":"Balister PN, Gy\u0151ri E, Lehel J, Schelp RH (2007) Adjacent vertex-distinguishing edge-coloring. SIAM J. Discret. Math. 21:237\u2013250","journal-title":"SIAM J. Discret. Math."},{"issue":"2013","key":"9796_CR2","first-page":"313","volume":"16","author":"M Bonamy","year":"2013","unstructured":"Bonamy M, Bousquet N, Hocquard H (2013) Adjacent vertex-distinguishing edge coloring of graphs. EuroComb 16(2013):313\u2013318","journal-title":"EuroComb"},{"key":"9796_CR3","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":"9796_CR4","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s00373-006-0671-2","volume":"22","author":"K Edwards","year":"2006","unstructured":"Edwards K, Hor\u0148\u00e1k M, Wo\u017aniak M (2006) On the neighbour-distinguishing index of a graph. Graphs Comb. 22:341\u2013350","journal-title":"Graphs Comb."},{"key":"9796_CR5","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 $$ \u0394 + 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":"9796_CR6","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/s10878-011-9444-9","volume":"26","author":"H Hocquard","year":"2013","unstructured":"Hocquard H, Montassier M (2013) Adjacent vertex-distinguishing edge coloring of graphs with maximum degree $$\\Delta $$ \u0394 . J. Comb. Optim. 26:152\u2013160","journal-title":"J. Comb. Optim."},{"key":"9796_CR7","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1002\/jgt.21764","volume":"76","author":"M Hor\u0148\u00e1k","year":"2014","unstructured":"Hor\u0148\u00e1k M, Huang D, Wang W (2014) On neighbor-distinguishing index of planar graphs. J. Graph Theory 76:262\u2013278","journal-title":"J. Graph Theory"},{"key":"9796_CR8","first-page":"9","volume":"5","author":"VG Vizing","year":"1965","unstructured":"Vizing VG (1965) Critical graphs with a given chromatic index (in Russian). Diskret. Anal. 5:9\u201317","journal-title":"Diskret. Anal."},{"key":"9796_CR9","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":"9796_CR10","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 coloring of $$K_4$$ K 4 -minor free graphs. Appl. Math. Lett. 24:2034\u20132037","journal-title":"Appl. Math. Lett."},{"key":"9796_CR11","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-014-9796-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9796-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9796-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:23:24Z","timestamp":1559262204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9796-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,26]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["9796"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9796-z","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,26]]}}}