{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T16:26:29Z","timestamp":1655483189458},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T00:00:00Z","timestamp":1351555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s00373-012-1251-2","type":"journal-article","created":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T20:18:53Z","timestamp":1351541933000},"page":"183-195","source":"Crossref","is-referenced-by-count":3,"title":["d-strong Edge Colorings of Graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Arnfried","family":"Kemnitz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Marangio","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,30]]},"reference":[{"key":"1251_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.: r-Strong edge colorings of graphs. Discrete Math. 306, 3005\u20133010 (2006)","journal-title":"Discrete Math."},{"key":"1251_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1137\/S0895480102414107","volume":"21","author":"P.N. Balister","year":"2007","unstructured":"Balister P.N., Gy\u0151ri E., Lehel J., Schelp R.H.: Adjacent vertex distinguishing edge-colorings. SIAM J. Discrete Math. 21, 237\u2013250 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"1251_CR3","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1006\/jctb.1998.1884","volume":"75","author":"C. Bazgan","year":"1999","unstructured":"Bazgan C., Harkat-Benhamdine A.H., Li H., Wo\u017aniak M.: On the vertex-distinguishing proper edge-colorings of graphs. J. Combin. Theory Ser. B 75, 288\u2013301 (1999)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1251_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/S0012-365X(00)00428-3","volume":"236","author":"C. Bazgan","year":"2001","unstructured":"Bazgan C., Harkat-Benhamdine A.H., Li H., Wo\u017aniak M.: A note on the vertex-distinguishing proper coloring of graphs with large minimum degree. Discrete Math. 236, 37\u201342 (2001)","journal-title":"Discrete Math."},{"key":"1251_CR5","unstructured":"Bode, J.-P.: private communication"},{"key":"1251_CR6","unstructured":"Burris, A.C.: Vertex-distinguishing edge colorings. Doctorate thesis, Memphis State University (1993)"},{"key":"1251_CR7","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":"A.C. Burris","year":"1997","unstructured":"Burris A.C., Schelp R.H.: Vertex-distinguishing proper edge-colorings. J. Graph Theory 26, 73\u201382 (1997)","journal-title":"J. Graph Theory"},{"key":"1251_CR8","first-page":"21","volume":"46","author":"J. \u010cern\u00fd","year":"1996","unstructured":"\u010cern\u00fd J., Hor\u0148 M., Sot\u00e1k R.: Observability of a graph. Math. Slovaca 46, 21\u201331 (1996)","journal-title":"Math. Slovaca"},{"key":"1251_CR9","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 M., Wo\u017aniak M.: On the neighbour-distinguishing index of a graph. Graphs Combin. 22, 341\u2013350 (2006)","journal-title":"Graphs Combin."},{"key":"1251_CR10","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 R.H.: Strong edge colorings of graphs. Discrete Math. 159, 103\u2013109 (1996)","journal-title":"Discrete Math."},{"key":"1251_CR11","unstructured":"Frobenius, G.: \u00dcber Matrizen aus nichtnegativen Elementen. Sitzungsber. Preuss. Akad. Wiss. Berlin, 456\u2013477 (1912)"},{"key":"1251_CR12","unstructured":"Sot\u00e1k, R.: Invariants of regular graphs (in Slovak). Diploma thesis, Ko\u0161ice (1992)"},{"key":"1251_CR13","first-page":"223","volume":"23","author":"K. Taczuk","year":"2004","unstructured":"Taczuk K., Wo\u017aniak M.: A note on the vertex-distinguishing index for some cubic graphs. Opuscula Math. 23, 223\u2013229 (2004)","journal-title":"Opuscula Math."},{"key":"1251_CR14","first-page":"453","volume":"4489","author":"J.J. Tian","year":"2007","unstructured":"Tian J.J., Liu X., Zhang Z., Deng F.: Upper bounds on the D(\u03b2)-vertex-distinguishing edge-chromatic-numbers of graphs. LNCS 4489, 453\u2013456 (2007)","journal-title":"LNCS"},{"key":"1251_CR15","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.: Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree. J. Comb. Optim. 19, 471\u2013485 (2010)","journal-title":"J. Comb. Optim."},{"key":"1251_CR16","first-page":"703","volume":"49","author":"Z. Zhang","year":"2006","unstructured":"Zhang Z., Li J., Chen X. et\u00a0al.: D(\u03b2)-vertex-distinguishing proper edge-coloring of graphs. Acta Math. Sinica Chin. Ser. 49, 703\u2013708 (2006)","journal-title":"Acta Math. Sinica Chin. Ser."},{"key":"1251_CR17","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.: Adjacent strong edge coloring of graphs. Appl. Math. Lett. 15, 623\u2013626 (2002)","journal-title":"Appl. Math. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1251-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1251-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1251-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:34Z","timestamp":1559055574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1251-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,30]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["1251"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1251-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,30]]}}}