{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T20:49:06Z","timestamp":1781038146172,"version":"3.54.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,3,1]],"date-time":"2012-03-01T00:00:00Z","timestamp":1330560000000},"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":[[2013,7]]},"DOI":"10.1007\/s10878-011-9444-9","type":"journal-article","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T18:56:01Z","timestamp":1330541761000},"page":"152-160","source":"Crossref","is-referenced-by-count":33,"title":["Adjacent vertex-distinguishing edge coloring of graphs with maximum degree \u0394"],"prefix":"10.1007","volume":"26","author":[{"given":"Herv\u00e9","family":"Hocquard","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Micka\u00ebl","family":"Montassier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,3,1]]},"reference":[{"key":"9444_CR1","doi-asserted-by":"crossref","first-page":"3005","DOI":"10.1016\/j.disc.2004.12.027","volume":"306","author":"S Akbari","year":"2006","unstructured":"Akbari S, Bidkhori H, Nosrati N (2006) r-Strong edge colorings of graphs. Discrete Math 306:3005\u20133010","journal-title":"Discrete Math"},{"key":"9444_CR2","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1002\/jgt.10076","volume":"42","author":"PN Balister","year":"2003","unstructured":"Balister PN, Riordan OM, Schelp RH (2003) Vertex-distinguishing edge-colorings of graphs. J Graph Theory 42:95\u2013109","journal-title":"J Graph Theory"},{"key":"9444_CR3","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-colorings. SIAM J Discrete Math 21:237\u2013250","journal-title":"SIAM J Discrete Math"},{"key":"9444_CR4","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/(SICI)1097-0118(199710)26:2<73::AID-JGT2>3.0.CO;2-C","volume":"26","author":"AC Burris","year":"1997","unstructured":"Burris AC, Schelp RH (1997) Vertex-distinguishing proper edge-colorings. J Graph Theory 26:73\u201383","journal-title":"J Graph Theory"},{"issue":"1","key":"9444_CR5","first-page":"21","volume":"46","author":"J Cern\u00fd","year":"1996","unstructured":"Cern\u00fd J, Horn\u0306\u00e1k M, Sot\u00e1k R (1996) Observability of a graph. Math Slovaca 46(1):21\u201331","journal-title":"Math Slovaca"},{"key":"9444_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0012-365X(01)00387-9","volume":"255","author":"E Ded\u00f3","year":"2002","unstructured":"Ded\u00f3 E, Torri D, Zagaglia Salvi N (2002) The observability of the Fibonacci and the Lucas cubes. Discrete Math 255:55\u201363","journal-title":"Discrete Math"},{"key":"9444_CR7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0012-365X(95)00102-3","volume":"159","author":"O Favaron","year":"1996","unstructured":"Favaron O, Li H, Schelp RH (1996) Strong edge coloring of graphs. Discrete Math 159:103\u2013109","journal-title":"Discrete Math"},{"key":"9444_CR8","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/S0012-365X(96)00292-0","volume":"176","author":"M Horn\u0306\u00e1k","year":"1997","unstructured":"Horn\u0306\u00e1k M (1997) Asymptotic behaviour of the observability of\u00a0Q n . Discrete Math 176:139\u2013148","journal-title":"Discrete Math"},{"key":"9444_CR9","first-page":"289","volume":"41","author":"M Horn\u0306\u00e1k","year":"1995","unstructured":"Horn\u0306\u00e1k M, Sot\u00e1k R (1995) Observability of complete multipartite graphs with equipotent parts. Ars Comb 41:289\u2013301","journal-title":"Ars Comb"},{"key":"9444_CR10","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":"9444_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-011-9444-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9444-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9444-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:16Z","timestamp":1559276596000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9444-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9444"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9444-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,1]]}}}