{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:08:15Z","timestamp":1743116895908,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496134"},{"type":"electronic","value":"9783031496141"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49614-1_9","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"139-146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strong Edge Coloring of\u00a0Subquartic Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1561-5772","authenticated-orcid":false,"given":"Junlei","family":"Zhu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2876-7153","authenticated-orcid":false,"given":"Hongguo","family":"Zhu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"1\u20133","key":"9_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":"9_CR2","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.endm.2015.06.104","volume":"49","author":"J Bensmail","year":"2015","unstructured":"Bensmail, J., Bonamy, M., Hocquard, H.: Strong edge coloring sparse graphs. Electron. Note Discrete Math. 49, 773\u2013778 (2015)","journal-title":"Electron. Note Discrete Math."},{"key":"9_CR3","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"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1017\/S0963548317000244","volume":"27","author":"H Bruhn","year":"2018","unstructured":"Bruhn, H., Joos, F.: A strong bound for the strong chromatic index. Combin. Probab. Comput. 27(1), 21\u201343 (2018)","journal-title":"Combin. Probab. Comput."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.ejc.2017.06.001","volume":"67","author":"I Choi","year":"2018","unstructured":"Choi, I., Kim, J., Kostochka, A.V., Raspaud, A.: Strong edge-colorings of sparse graphs with large maximum degree. European J. Combin. 67, 21\u201339 (2018)","journal-title":"European J. Combin."},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"2772","DOI":"10.1016\/j.disc.2006.03.053","volume":"306","author":"DW Cranston","year":"2006","unstructured":"Cranston, D.W.: A strong bound edge-colouring of graphs with maximum degree 4 using 22 colours. Discrete Math. 306, 2772\u20132778 (2006)","journal-title":"Discrete Math."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-642-61324-1","volume-title":"Irregularities of Partitions","author":"P Erd\u0151s","year":"1989","unstructured":"Erd\u0151s, P., Ne\u0161et\u0159il, J., Hal\u00e1sz, G.: Irregularities of Partitions, pp. 161\u2013349. Springer, Berlin (1989). https:\/\/doi.org\/10.1007\/978-3-642-61324-1"},{"key":"9_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."},{"issue":"16\u201317","key":"9_CR9","doi-asserted-by":"publisher","first-page":"2467","DOI":"10.1016\/j.dam.2013.05.021","volume":"161","author":"H Hocquard","year":"2013","unstructured":"Hocquard, H., Montassier, M., Raspaud, A., Valicov, P.: On strong edge-colouring of subcubic graphs. Discrete Appl. Math. 161(16\u201317), 2467\u20132479 (2013)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9_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., Qing, H., Trotter, W.T.: Induced matching in cubic graphs. J. Graph Theory 17(2), 151\u2013160 (1993)","journal-title":"J. Graph Theory"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Huang, M.F., Santana, M., Yu, G.X.: Strong chromatic index of graphs with maximum degree four. Electron. J. Combin. 25(3), 3\u201331 (2018)","DOI":"10.37236\/7016"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Li, X.W., Li, Y.F., Lv, J.B., Wang, T.: Strong edge-colorings of sparse graphs with $$3\\Delta -1$$ colors. Inform. Process. Lett. 179, 106313 (2023)","DOI":"10.1016\/j.ipl.2022.106313"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1016\/j.dam.2017.09.006","volume":"235","author":"JB Lv","year":"2018","unstructured":"Lv, J.B., Li, X.W., Yu, G.X.: On strong edge-coloring of graphs with maximum degree 4. Discrete Appl. Math. 235, 142\u2013153 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/S0166-218X(01)00237-2","volume":"118","author":"M Mahdian","year":"2002","unstructured":"Mahdian, M.: On the computational complexity of strong edge-coloring. Discrete Appl. Math. 118(3), 239\u2013248 (2002)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9_CR15","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"},{"issue":"1","key":"9_CR16","first-page":"41","volume":"51","author":"LZ Qin","year":"2022","unstructured":"Qin, L.Z., Lv, J.B., Li, J.X.: Strong edge-coloring of some sparse graphs. Adv. Math. (China) 51(1), 41\u201352 (2022)","journal-title":"Adv. Math. (China)"},{"key":"9_CR17","first-page":"106","volume":"68","author":"W Ruksasakchai","year":"2017","unstructured":"Ruksasakchai, W., Wang, T.: List strong edge coloring of some classes of graphs. Australas. J. Combin. 68, 106\u2013117 (2017)","journal-title":"Australas. J. Combin."},{"key":"9_CR18","unstructured":"Zang C.Y.: The strong chromatic index of graphs with maximum degree $$\\Delta $$. arXiV1510.00785vl (2015)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49614-1_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:03:23Z","timestamp":1707555803000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49614-1_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496134","9783031496141"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49614-1_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"We declare that we have no conflicts of interest to this work. We also declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaration of Competing Interest"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}