{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:44:11Z","timestamp":1767314651863,"version":"3.48.0"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032118349","type":"print"},{"value":"9783032118356","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-11835-6_7","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:12Z","timestamp":1767314352000},"page":"91-104","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Chromatic Index Under Parameterized Settings"],"prefix":"10.1007","author":[{"given":"Sriram","family":"Bhyravarapu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Soumen","family":"Mandal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashutosh","family":"Rai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Saket","family":"Saurabh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaily","family":"Verma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal, G., Motwani, R., Shah, D., Zhu, A.: Switch scheduling via randomized edge coloring. In: 2003 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 502\u2013512. IEEE (2003)","DOI":"10.1109\/SFCS.2003.1238223"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s13173-011-0046-2","volume":"18","author":"SM de Almeida","year":"2012","unstructured":"de Almeida, S.M., de Mello, C.P., Morgana, A.: On the classification problem for split graphs. J. Braz. Comput. Soc. 18, 95\u2013101 (2012)","journal-title":"J. Braz. Comput. Soc."},{"key":"7_CR3","first-page":"363","volume":"119","author":"SM de Almeida","year":"2015","unstructured":"de Almeida, S.M., de Mello, C.P., Morgana, A.: Edge-coloring of split graphs. Ars Comb. 119, 363\u2013375 (2015)","journal-title":"Ars Comb."},{"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"},{"key":"7_CR5","unstructured":"Bodlaender, H.L., Jansen, B.M., Kratsch, S.: Cross-composition: a new technique for kernelization lower bounds. In: 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2011)"},{"issue":"1\u20133","key":"7_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00358-9","volume":"114","author":"V Bojarshinov","year":"2001","unstructured":"Bojarshinov, V.: Edge and total coloring of interval graphs. Discret. Appl. Math. 114(1\u20133), 23\u201328 (2001)","journal-title":"Discret. Appl. Math."},{"issue":"17","key":"7_CR7","doi-asserted-by":"publisher","first-page":"2690","DOI":"10.1016\/j.disc.2012.01.019","volume":"312","author":"CN Campos","year":"2012","unstructured":"Campos, C.N., de Figueiredo, C., Machado, R., de Mello, C.P.: The total chromatic number of split-indifference graphs. Discret. Math. 312(17), 2690\u20132693 (2012)","journal-title":"Discret. Math."},{"key":"7_CR8","first-page":"137","volume":"17","author":"B Chen","year":"1995","unstructured":"Chen, B., Fu, H., Ko, M., et al.: Total chromatic number and chromatic index of split graphs. J. Combin. Math. Combin. Comput. 17, 137\u2013146 (1995)","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, M., Yin, L.: Transmission scheduling in sensor networks via directed edge coloring. In: 2007 IEEE International Conference on Communications, pp. 3710\u20133715. IEEE (2007)","DOI":"10.1109\/ICC.2007.611"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.dam.2024.09.008","volume":"360","author":"F Couto","year":"2025","unstructured":"Couto, F., Ferraz, D.A., Klein, S.: New results on edge-coloring and total-coloring of split graphs. Discret. Appl. Math. 360, 297\u2013306 (2025)","journal-title":"Discret. Appl. Math."},{"key":"7_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"7_CR12","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1016\/j.dam.2021.05.021","volume":"323","author":"CM de Figueiredo","year":"2022","unstructured":"de Figueiredo, C.M., de Melo, A.A., Sasaki, D., Silva, A.: Revising Johnson\u2019s table for the 21st century. Discret. Appl. Math. 323, 184\u2013200 (2022)","journal-title":"Discret. Appl. Math."},{"key":"7_CR13","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co. (1979)"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of edge-coloring. SIAM J. Comput. 10(4), 718\u2013720 (1981)","journal-title":"SIAM J. Comput."},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1007\/11533719_81","volume-title":"Computing and Combinatorics","author":"T Ito","year":"2005","unstructured":"Ito, T., Kato, A., Zhou, X., Nishizeki, T.: Algorithms for finding distance-edge-colorings of graphs. In: Wang, L. (ed.) COCOON 2005. LNCS, vol. 3595, pp. 798\u2013807. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11533719_81"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/BF01456961","volume":"77","author":"D K\u00f6nig","year":"1916","unstructured":"K\u00f6nig, D.: \u00dcber graphen und ihre anwendung auf determinantentheorie und mengenlehre. Math. Ann. 77(4), 453\u2013465 (1916)","journal-title":"Math. Ann."},{"issue":"1\u20133","key":"7_CR17","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\u20133), 285\u2013291 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"7_CR18","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jctb.2001.2047","volume":"83","author":"DP Sanders","year":"2001","unstructured":"Sanders, D.P., Zhao, Y.: Planar graphs of maximum degree seven are class I. J. Combin. Theory Ser. B 83(2), 201\u2013212 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"7_CR19","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.procs.2021.11.040","volume":"195","author":"LG da Soledade Gonzaga","year":"2021","unstructured":"da Soledade Gonzaga, L.G., de Almeida, S.M., de Sousa Cruz, J.B., et al.: The chromatic index of split-interval graphs. Procedia Comput. Sci. 195, 325\u2013333 (2021)","journal-title":"Procedia Comput. Sci."},{"key":"7_CR20","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskret Analiz. 3, 25\u201330 (1964)","journal-title":"Diskret Analiz."},{"key":"7_CR21","first-page":"9","volume":"5","author":"VG Vizing","year":"1965","unstructured":"Vizing, V.G.: Critical graphs with given chromatic class (in Russian). Metody Discret. Analiz. 5, 9\u201317 (1965)","journal-title":"Metody Discret. Analiz."},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1287\/opre.45.2.288","volume":"45","author":"DP Williamson","year":"1997","unstructured":"Williamson, D.P., et al.: Short shop schedules. Oper. Res. 45(2), 288\u2013294 (1997)","journal-title":"Oper. Res."},{"issue":"3","key":"7_CR23","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 partial k-trees. J. Algorithms 21(3), 598\u2013617 (1996). https:\/\/doi.org\/10.1006\/jagm.1996.0061","journal-title":"J. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11835-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T00:39:14Z","timestamp":1767314354000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11835-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032118349","9783032118356"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11835-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Otzenhausen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo.uni-trier.de\/wg2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}