{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:30:39Z","timestamp":1743003039731,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":21,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819778003"},{"type":"electronic","value":"9789819778010"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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-981-97-7801-0_7","type":"book-chapter","created":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:05:37Z","timestamp":1726769137000},"page":"76-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Polynomial Time Algorithm to\u00a0Find Star Chromatic Index on\u00a0Bounded Treewidth Graphs with\u00a0Given Maximum Degree"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0960-9836","authenticated-orcid":false,"given":"Yichen","family":"Wang","sequence":"first","affiliation":[]},{"given":"Mei","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,9,19]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Albertson, M.O., Chappell, G.G., Kierstead, H.A., K\u00fcndgen, A., Ramamurthi, R.: Coloring with no $$2 $$-colored $$P_4$$\u2019s. Electron. J. Comb. 11, R26 (2004)","DOI":"10.37236\/1779"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a $$k$$-tree. SIAM J. Algebraic Discrete Methods 8(2), 277\u2013284 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"7_CR3","unstructured":"Bertele, U., Brioschi., F.: Nonserial Dynamic Programming, Academic Press, Inc. (1972)"},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1016\/0196-6774(90)90013-5","volume":"11","author":"HL Bodlaender","year":"1990","unstructured":"Bodlaender, H.L.: Polynomial algorithms for graph isomorphism and chromatic index on partial $$k$$-trees. J. Algorithms 11(4), 631\u2013643 (1990)","journal-title":"J. Algorithms"},{"issue":"6","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1137\/S0097539793251219","volume":"25","author":"HL Bodlaender","year":"1996","unstructured":"Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305\u20131317 (1996)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"7_CR6","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1002\/jgt.21874","volume":"81","author":"H Bruhn","year":"2016","unstructured":"Bruhn, H., Lang, R., Stein, M.: List edge-coloring and total coloring in graphs of low treewidth. J. Graph Theory 81(3), 272\u2013282 (2016)","journal-title":"J. Graph Theory"},{"issue":"1","key":"7_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0720013","volume":"20","author":"TF Coleman","year":"1983","unstructured":"Coleman, T.F., Mor\u00e9, J.J.: Estimation of sparse jacobian matrices and graph coloring blems. SIAM J. Numer. Anal. 20(1), 187\u2013209 (1983)","journal-title":"SIAM J. Numer. Anal."},{"issue":"3","key":"7_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/jgt.21644","volume":"72","author":"Z Dvo\u0159\u00e1k","year":"2013","unstructured":"Dvo\u0159\u00e1k, Z., Mohar, B., \u0160\u00e1mal, R.: Star chromatic index. J. Graph Theory 72(3), 313\u2013326 (2013)","journal-title":"J. Graph Theory"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1002\/jgt.20029","volume":"47","author":"G Fertin","year":"2004","unstructured":"Fertin, G., Raspaud, A., Reed, B.: Star coloring of graphs. J. Graph Theory 47(3), 163\u2013182 (2004)","journal-title":"J. Graph Theory"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/BF01917434","volume":"8","author":"R Halin","year":"1976","unstructured":"Halin, R.: $$S$$-functions for graphs. J. Geom. 8, 171\u2013186 (1976)","journal-title":"J. Geom."},{"issue":"7","key":"7_CR11","doi-asserted-by":"publisher","first-page":"1835","DOI":"10.1016\/j.disc.2018.03.012","volume":"341","author":"S Kerdjoudj","year":"2018","unstructured":"Kerdjoudj, S., Pradeep, K., Raspaud, A.: List star chromatic index of sparse graphs. Discret. Math. 341(7), 1835\u20131849 (2018)","journal-title":"Discret. Math."},{"issue":"1","key":"7_CR12","first-page":"77","volume":"50","author":"H Lei","year":"2021","unstructured":"Lei, H., Shi, Y.: A survey on star edge-coloring of graphs. Adv. Math. (China) 50(1), 77\u201393 (2021)","journal-title":"Adv. Math. (China)"},{"issue":"4","key":"7_CR13","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1002\/jgt.22230","volume":"88","author":"H Lei","year":"2018","unstructured":"Lei, H., Shi, Y., Song, Z.X.: Star chromatic index of subcubic multigraphs. J. Graph Theory 88(4), 566\u2013576 (2018)","journal-title":"J. Graph Theory"},{"key":"7_CR14","unstructured":"Liu, X.S., Deng, K.: An upper bound on the star chromatic index of graphs with $$\\varDelta \\ge 7$$. J. Lanzhou Univ. Nat. Sci. 44, 94\u201395 (2008)"},{"key":"7_CR15","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.endm.2017.07.043","volume":"61","author":"B Lu\u017ear","year":"2017","unstructured":"Lu\u017ear, B., Mockov\u010diakov\u00e1, M., Sot\u00e1k, R.: On a star chromatic index of subcubic graphs. Electron. Notes in Discrete Math. 61, 835\u2013839 (2017)","journal-title":"Electron. Notes in Discrete Math."},{"key":"7_CR16","doi-asserted-by":"crossref","unstructured":"Omoomi, B., Roshanbin, E., Dastjerdi, M.V.: A polynomial time algorithm to find the star chromatic index of trees. Electron. J. Combin. 28(1), 1.6 (2021)","DOI":"10.37236\/9202"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.endm.2016.05.014","volume":"53","author":"K Pradeep","year":"2016","unstructured":"Pradeep, K., Vijayalakshmi, V.: Star chromatic index of subcubic graphs. Electron. Notes Discrete Math. 53, 155\u2013164 (2016)","journal-title":"Electron. Notes Discrete Math."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. iii. planar tree-width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984)","DOI":"10.1016\/0095-8956(84)90013-3"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.dam.2004.03.001","volume":"143","author":"MR Salavatipour","year":"2004","unstructured":"Salavatipour, M.R.: A polynomial time algorithm for strong edge coloring of partial $$k$$-trees. Discret. Appl. Math. 143(1), 285\u2013291 (2004)","journal-title":"Discret. Appl. Math."},{"key":"7_CR20","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/j.cam.2017.10.034","volume":"333","author":"Y Wang","year":"2018","unstructured":"Wang, Y., Wang, W., Wang, Y.: Edge-partition and star chromatic index. Appl. Math. Comput. 333, 480\u2013489 (2018)","journal-title":"Appl. Math. Comput."},{"issue":"3","key":"7_CR21","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1006\/jagm.1996.0061","volume":"21","author":"X Zhou","year":"1996","unstructured":"Zhou, X., Nakano, S., Nishizeki, T.: Edge-coloring partialk-trees. J. Algorithms 21(3), 598\u2013617 (1996)","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-7801-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T18:07:56Z","timestamp":1726769276000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-7801-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819778003","9789819778010"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-7801-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"19 September 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Aspects in Information and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dallas, TX","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":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/AAIM2024\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}