{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T20:04:00Z","timestamp":1773691440688,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T00:00:00Z","timestamp":1696809600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T00:00:00Z","timestamp":1696809600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100014718","name":"Innovative Research Group Project of the National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11861069"],"award-info":[{"award-number":["11861069"]}],"id":[{"id":"10.13039\/100014718","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2023,12]]},"DOI":"10.1007\/s00373-023-02714-z","type":"journal-article","created":{"date-parts":[[2023,10,9]],"date-time":"2023-10-09T09:27:24Z","timestamp":1696843644000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Strong List-Chromatic Index of Planar Graphs with Ore-Degree at Most Seven"],"prefix":"10.1007","volume":"39","author":[{"given":"Mingfang","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guorong","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0662-4792","authenticated-orcid":false,"given":"Xiangqian","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,9]]},"reference":[{"issue":"1\u20133","key":"2714_CR1","doi-asserted-by":"publisher","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$$. Discrete Math. 108(1\u20133), 231\u2013252 (1992)","journal-title":"Discrete Math."},{"key":"2714_CR2","unstructured":"Bonamy, M., Perrett, T., Postle, L.: Colouring graphs with sparse neighbourhoods: bounds and applications. arXiv:1810.06704"},{"issue":"4","key":"2714_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.111779","volume":"343","author":"L Chen","year":"2020","unstructured":"Chen, L., Huang, M., Yu, G., Zhou, X.: The strong edge-coloring for graphs with small edge weight. Discrete Math. 343(4), 111779 (2020)","journal-title":"Discrete Math."},{"issue":"5","key":"2714_CR4","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1016\/j.disc.2018.10.034","volume":"342","author":"M Chen","year":"2019","unstructured":"Chen, M., Hu, J., Yu, X., Zhou, S.: List strong edge coloring of planar graphs with maximum degree 4. Discrete Math. 342(5), 1471\u20131480 (2019)","journal-title":"Discrete Math."},{"issue":"12","key":"2714_CR5","doi-asserted-by":"publisher","first-page":"3434","DOI":"10.1016\/j.disc.2018.08.028","volume":"341","author":"T Dai","year":"2018","unstructured":"Dai, T., Wang, G., Yang, D., Yu, G.: Strong list-chromatic index of subcubic graphs. Discrete Math. 341(12), 3434\u20133440 (2018)","journal-title":"Discrete Math."},{"key":"2714_CR6","first-page":"162","volume-title":"Irregularities of Partitions, Algorithms and Combinatorics: Study and Research Texts","author":"P Erd\u0151s","year":"1989","unstructured":"Erd\u0151s, P., Ne\u0161et\u0159il, J.: Problems. In: Hal\u00e1sz, G., S\u00f3s, V.T. (eds.) Irregularities of Partitions, Algorithms and Combinatorics: Study and Research Texts, vol. 8, pp. 162\u2013163. Springer, Berlin (1989)"},{"issue":"B","key":"2714_CR7","first-page":"205","volume":"29","author":"RJ Faudree","year":"1990","unstructured":"Faudree, R.J., Schelp, R.H., Gy\u00e1rf\u00e1s, A., Tuza, Z.: The strong chromatic index of graphs. Ars Combin. 29(B), 205\u2013211 (1990)","journal-title":"Ars Combin."},{"issue":"A","key":"2714_CR8","first-page":"141","volume":"16","author":"J-L Fouquet","year":"1983","unstructured":"Fouquet, J.-L., Jolivet, J.-L.: Strong edge-colorings of graphs and applications to multi-$$k$$-gons. Ars Combin. 16(A), 141\u2013150 (1983)","journal-title":"Ars Combin."},{"issue":"1","key":"2714_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1112\/jlms\/s1-10.37.26","volume":"s1\u201310","author":"P Hall","year":"1935","unstructured":"Hall, P.: On representatives of subsets. J. Lond. Math. Soc. s1\u201310(1), 26\u201330 (1935)","journal-title":"J. Lond. Math. Soc."},{"issue":"2","key":"2714_CR10","doi-asserted-by":"publisher","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. Graph Theory 17(2), 151\u2013160 (1993)","journal-title":"J. Graph Theory"},{"issue":"3","key":"2714_CR11","doi-asserted-by":"publisher","first-page":"#3.31","DOI":"10.37236\/7016","volume":"25","author":"M Huang","year":"2018","unstructured":"Huang, M., Santana, M., Yu, G.: Strong chromatic index of graphs with maximum degree four. Electron. J. Combin. 25(3), #3.31 (2018)","journal-title":"Electron. J. Combin."},{"key":"2714_CR12","doi-asserted-by":"crossref","unstructured":"Ma, H., Miao, Z., Zhu, H., Zhang, J., Luo, R.: Strong list edge coloring of subcubic graphs. Math. Probl. Eng. 316501 (2013)","DOI":"10.1155\/2013\/316501"},{"issue":"2","key":"2714_CR13","doi-asserted-by":"publisher","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":"2714_CR14","first-page":"373","volume":"118","author":"K Nakprasit","year":"2015","unstructured":"Nakprasit, K., Nakprasit, K.: The strong chromatic index of graphs with restricted Ore-degrees. Ars Combin. 118, 373\u2013380 (2015)","journal-title":"Ars Combin."},{"key":"2714_CR15","volume-title":"The Four Color Problem","author":"O Ore","year":"1967","unstructured":"Ore, O.: The Four Color Problem. Academic Press, New York (1967)"},{"issue":"6","key":"2714_CR16","doi-asserted-by":"publisher","first-page":"1629","DOI":"10.1016\/j.disc.2018.02.025","volume":"341","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Shiu, W.C., Wang, W., Chen, M.: Planar graphs with maximum degree 4 are strongly 19-edge-colorable. Discrete Math. 341(6), 1629\u20131635 (2018)","journal-title":"Discrete Math."},{"issue":"24","key":"2714_CR17","doi-asserted-by":"publisher","first-page":"6254","DOI":"10.1016\/j.disc.2007.11.051","volume":"308","author":"J Wu","year":"2008","unstructured":"Wu, J., Lin, W.: The strong chromatic index of a class of graphs. Discrete Math. 308(24), 6254\u20136261 (2008)","journal-title":"Discrete Math."},{"issue":"6","key":"2714_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2020.111854","volume":"343","author":"B Zhang","year":"2020","unstructured":"Zhang, B., Chang, Y., Hu, J., Ma, M., Yang, D.: List strong edge-coloring of graphs with maximum degree 4. Discrete Math. 343(6), 111854 (2020)","journal-title":"Discrete Math."},{"key":"2714_CR19","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1016\/j.disc.2014.06.004","volume":"333","author":"H Zhu","year":"2014","unstructured":"Zhu, H., Miao, Z.: On strong list edge coloring of subcubic graphs. Discrete Math. 333, 6\u201313 (2014)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02714-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-023-02714-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-023-02714-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T17:03:11Z","timestamp":1702573391000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-023-02714-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,9]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["2714"],"URL":"https:\/\/doi.org\/10.1007\/s00373-023-02714-z","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,9]]},"assertion":[{"value":"26 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known financial interests or personal relationships that could have influenced the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"116"}}