{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:39:48Z","timestamp":1740148788418,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,26]],"date-time":"2023-02-26T00:00:00Z","timestamp":1677369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,2,26]],"date-time":"2023-02-26T00:00:00Z","timestamp":1677369600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12171239"],"award-info":[{"award-number":["12171239"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J. Appl. Math. Comput."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s12190-023-01847-x","type":"journal-article","created":{"date-parts":[[2023,2,26]],"date-time":"2023-02-26T04:19:06Z","timestamp":1677385146000},"page":"2503-2508","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A note on strong edge-coloring of claw-free cubic graphs"],"prefix":"10.1007","volume":"69","author":[{"given":"Zhenmeng","family":"Han","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0196-9265","authenticated-orcid":false,"given":"Qing","family":"Cui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,2,26]]},"reference":[{"key":"1847_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, 231\u2013252 (1992)","journal-title":"Discrete Math."},{"key":"1847_CR2","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.jctb.2022.01.009","volume":"155","author":"M Bonamy","year":"2022","unstructured":"Bonamy, M., Perrett, T., Postle, L.: Colouring graphs with sparse neighbourhoods: bounds and applications. J. Combin. Theory Ser. B 155, 278\u2013317 (2022)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1847_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1017\/S0963548317000244","volume":"27","author":"H Bruhn","year":"2018","unstructured":"Bruhn, H., Joos, F.: A stronger bound for the strong chromatic index. Combin. Probab. Comput. 27, 21\u201343 (2018)","journal-title":"Combin. Probab. Comput."},{"key":"1847_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.dam.2020.03.024","volume":"284","author":"M D\u0229bski","year":"2020","unstructured":"D\u0229bski, M., Junosza-Szaniawski, K., \u015aleszy\u0144ska-Nowak, M.: Strong chromatic index of $$K_{1, t}$$-free graphs. Discrete Appl. Math. 284, 53\u201360 (2020)","journal-title":"Discrete Appl. Math."},{"key":"1847_CR5","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0012-365X(88)90196-3","volume":"72","author":"P Erd\u0151s","year":"1988","unstructured":"Erd\u0151s, P.: Problems and results in combinatorial analysis and graph theory. Discrete Math. 72, 81\u201392 (1988)","journal-title":"Discrete Math."},{"key":"1847_CR6","first-page":"162","volume-title":"Irregularities of Partitions","author":"P Erd\u0151s","year":"1989","unstructured":"Erd\u0151s, P., Ne\u0161et\u0159il, J.: Problem. In: Hal\u00e1sz, G., S\u00f3s, V.T. (eds.) Irregularities of Partitions, pp. 162\u2013163. Springer, Berlin (1989)"},{"key":"1847_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, 205\u2013211 (1990)","journal-title":"Ars Combin."},{"key":"1847_CR8","first-page":"141","volume":"16","author":"JL Fouquet","year":"1983","unstructured":"Fouquet, J.L., Jolivet, J.L.: Strong edge-colorings of graphs and applications to multi-$$k$$-gons. Ars Combin. 16, 141\u2013150 (1983)","journal-title":"Ars Combin."},{"key":"1847_CR9","series-title":"(Waterloo, 1982)","first-page":"247","volume-title":"Progress in Graph Theory","author":"JL Fouquet","year":"1984","unstructured":"Fouquet, J.L., Jolivet, J.L.: Strong edge-coloring of cubic planar graphs. In: Progress in Graph Theory. (Waterloo, 1982), pp. 247\u2013264. Academic Press, Toronto (1984)"},{"key":"1847_CR10","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1016\/j.ipl.2013.07.026","volume":"113","author":"H Hocquard","year":"2013","unstructured":"Hocquard, H., Ochem, P., Valicov, P.: Strong edge-colouring and induced matchings. Inform. Process. Lett. 113, 836\u2013843 (2013)","journal-title":"Inform. Process. Lett."},{"key":"1847_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1002\/jgt.3190170204","volume":"17","author":"P Hor\u00e1k","year":"1993","unstructured":"Hor\u00e1k, P., Qing, H., Trotter, W.T.: Induced matchings in cubic graphs. J. Graph Theory 17, 151\u2013160 (1993)","journal-title":"J. Graph Theory"},{"key":"1847_CR12","doi-asserted-by":"crossref","unstructured":"Huang, M., Santana, M., Yu, G.: Strong chromatic index of graphs with maximum degree four. Electron. J. Combin. 25, $$\\#$$P3.31 (2018)","DOI":"10.37236\/7016"},{"key":"1847_CR13","doi-asserted-by":"crossref","unstructured":"Hurley, E., de Joannis de Verclos, R., Kang, R.J.: An improved procedure for colouring graphs of bounded local density. Adv. Combin. 7 (2022)","DOI":"10.19086\/aic.2022.7"},{"key":"1847_CR14","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1016\/j.ejc.2015.07.002","volume":"51","author":"AV Kostochka","year":"2016","unstructured":"Kostochka, A.V., Li, X., Ruksasakchai, W., Santana, M., Wang, T., Yu, G.: Strong chromatic index of subcubic planar multigraphs. Eur. J. Combin. 51, 380\u2013397 (2016)","journal-title":"Eur. J. Combin."},{"key":"1847_CR15","doi-asserted-by":"crossref","unstructured":"Lin, Y., Lin, W.: The tight bound for the strong chromatic indices of claw-free subcubic graphs. arXiv preprint (2022) arXiv:2207.10264","DOI":"10.1007\/s00373-023-02655-7"},{"key":"1847_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/s00373-022-02462-6","volume":"38","author":"J-B Lv","year":"2022","unstructured":"Lv, J.-B., Li, J., Zhang, X.: On strong edge-coloring of claw-free subcubic graphs. Graphs Combin. 38, 63 (2022)","journal-title":"Graphs Combin."},{"key":"1847_CR17","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, 103\u2013109 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1847_CR18","doi-asserted-by":"crossref","unstructured":"Nandagopal, T., Kim, T.-E., Gao, X., Bharghavan, V.: Achieving MAC layer fairness in wireless packet networks, in: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking, pp 87\u201398. (2000)","DOI":"10.1145\/345910.345925"},{"key":"1847_CR19","doi-asserted-by":"crossref","unstructured":"Ramanathan, S.: A unified framework and algorithm for (T\/F\/C)DMA channel assignment in wireless networks, in: Proceedings of the INFOCOM\u201997, pp 900\u2013907. (1997)","DOI":"10.1109\/INFCOM.1997.644573"},{"key":"1847_CR20","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, 1629\u20131635 (2018)","journal-title":"Discrete Math."}],"container-title":["Journal of Applied Mathematics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01847-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12190-023-01847-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12190-023-01847-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T05:11:07Z","timestamp":1728969067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12190-023-01847-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,26]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1847"],"URL":"https:\/\/doi.org\/10.1007\/s12190-023-01847-x","relation":{},"ISSN":["1598-5865","1865-2085"],"issn-type":[{"type":"print","value":"1598-5865"},{"type":"electronic","value":"1865-2085"}],"subject":[],"published":{"date-parts":[[2023,2,26]]},"assertion":[{"value":"8 November 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 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 conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}