{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T01:47:01Z","timestamp":1778032021350,"version":"3.51.4"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,9,23]],"date-time":"2014-09-23T00:00:00Z","timestamp":1411430400000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1007\/s00373-014-1478-1","type":"journal-article","created":{"date-parts":[[2014,9,22]],"date-time":"2014-09-22T06:58:22Z","timestamp":1411369102000},"page":"1815-1818","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Strong edge-colorings for $$k$$ k -degenerate graphs"],"prefix":"10.1007","volume":"31","author":[{"given":"Gexin","family":"Yu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,23]]},"reference":[{"issue":"1\u20133","key":"1478_CR1","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0012-365X(92)90678-9","volume":"108","author":"LD Andersen","year":"1992","unstructured":"Andersen, L.D.: The strong chromatic index of a cubic graph is at most 10. Topological, algebraical and combinatorial structures. Frol\u00edk\u2019s memorial volume. Discrete Math. 108(1\u20133), 231\u2013252 (1992)","journal-title":"Discrete Math."},{"issue":"2","key":"1478_CR2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/jgt.21646","volume":"73","author":"GJ Chang","year":"2013","unstructured":"Chang, G.J., Narayanan, N.: Strong chromatic index of 2-degenerate graphs. J. Gr. Theory 73(2), 119\u2013126 (2013)","journal-title":"J. Gr. Theory"},{"issue":"2","key":"1478_CR3","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0012-365X(90)90144-7","volume":"81","author":"FRK Chung","year":"1990","unstructured":"Chung, F.R.K., Gy\u00e1rf\u00e1s, A., Trotter, W.T., Tuza, Z.: The maximum number of edges in $$2K_2$$ 2 K 2 -free graphs of bounded degree. Discrete Math. 81(2), 129\u2013135 (1990)","journal-title":"Discrete Math."},{"issue":"21","key":"1478_CR4","doi-asserted-by":"crossref","first-page":"2772","DOI":"10.1016\/j.disc.2006.03.053","volume":"306","author":"DW Cranston","year":"2006","unstructured":"Cranston, D.W.: Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discrete Math. 306(21), 2772\u20132778 (2006)","journal-title":"Discrete Math."},{"key":"1478_CR5","first-page":"141","volume":"16A","author":"JL Fouquet","year":"1983","unstructured":"Fouquet, J.L., Jolivet, J.L.: Strong edge-coloring of graphs and applications to multi-k-gons. Ars Combinatoria 16A, 141\u2013150 (1983)","journal-title":"Ars Combinatoria"},{"issue":"2","key":"1478_CR6","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1002\/jgt.3190170204","volume":"17","author":"P Hor\u00e1k","year":"1993","unstructured":"Hor\u00e1k, P., He, Q., Trotter, W.T.: Induced matchings in cubic graphs. J. Gr. Theory 17(2), 151\u2013160 (1993)","journal-title":"J. Gr. Theory"},{"key":"1478_CR7","unstructured":"Luo, R., Yu, G.: A note on strong edge-colorings of $$2$$ 2 -degenerate graphs. http:\/\/arxiv.org\/abs\/1212.6092"},{"issue":"2","key":"1478_CR8","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1006\/jctb.1997.1724","volume":"69","author":"M Molloy","year":"1997","unstructured":"Molloy, M., Reed, B.: A bound on the strong chromatic index of a graph. J. Combin. Theory Ser. B 69(2), 103\u2013109 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1478_CR9","volume-title":"Graph Edge Coloring","author":"M Steibitz","year":"2012","unstructured":"Steibitz, M., Scheide, D., Toft, B., Favrholdt, L.M.: Graph Edge Coloring. Wiley, New York (2012)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1478-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1478-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1478-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:38Z","timestamp":1559055578000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1478-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,23]]},"references-count":9,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2015,9]]}},"alternative-id":["1478"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1478-1","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,23]]}}}