{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T00:57:41Z","timestamp":1743037061498,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":12,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819610921"},{"type":"electronic","value":"9789819610938"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-981-96-1093-8_22","type":"book-chapter","created":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:19:10Z","timestamp":1739999950000},"page":"265-271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strong Chromatic Index of\u00a0Graphs with\u00a0Small Girth"],"prefix":"10.1007","author":[{"given":"Yuehua","family":"Bu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongrui","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongguo","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,2,20]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"31","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. Discret. Math. 108, 31\u2013252 (1992)","journal-title":"Discret. Math."},{"key":"22_CR2","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. Comb. Probab. Comput. 27, 21\u201343 (2018)","journal-title":"Comb. Probab. Comput."},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"J. Bensmail, A. Harutyunyan, H. Hocquard. P. Valicov. Strong edge-coloring of sparse planar graphs. Discrete Applied Mathematics, 2014, 179:229\u2013234","DOI":"10.1016\/j.dam.2014.07.006"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0012-365X(93)90286-3","volume":"122","author":"RA Brualdi","year":"1993","unstructured":"Brualdi, R.A., Quinn Massey, J.J.: Incidence and strong edge colorings of graphs. Discrete Math. 122, 51\u201358 (1993)","journal-title":"Discrete Math."},{"key":"22_CR5","unstructured":"Bonamy, M., Perrett, T., Postle, L.: Colouring graphs with sparse neighbourhoods: bounds and applications. arXiv:1810.06704"},{"key":"22_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.: Strong edge-coloring of graphs with maximum degree 4 using 22 colors. Discret. Math. 306, 2772\u20132778 (2006)","journal-title":"Discret. Math."},{"key":"22_CR7","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":"22_CR8","first-page":"141","volume":"16A","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. 16A, 141\u2013150 (1983)","journal-title":"Ars Combin."},{"key":"22_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. Discret. Appl. Math. 161, 2467\u20132479 (2013)","journal-title":"Discret. Appl. Math."},{"key":"22_CR10","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":"22_CR11","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":"22_CR12","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0012-365X(93)90590-P","volume":"120","author":"A Steger","year":"1993","unstructured":"Steger, A., Yu, M.-L.: On induced matchings. Discret. Math. 120, 291\u2013295 (1993)","journal-title":"Discret. Math."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-1093-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,19]],"date-time":"2025-02-19T21:19:13Z","timestamp":1739999953000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-1093-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9789819610921","9789819610938"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-1093-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"20 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/anl.sjtu.edu.cn\/cocoon2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}