{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:14:54Z","timestamp":1742912094530,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030950170"},{"type":"electronic","value":"9783030950187"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-030-95018-7_7","type":"book-chapter","created":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:04Z","timestamp":1642982704000},"page":"78-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of\u00a0Star Colouring in\u00a0Bounded Degree Graphs and\u00a0Regular Graphs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4399-0791","authenticated-orcid":false,"given":"M. A.","family":"Shalu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7503-801X","authenticated-orcid":false,"given":"Cyriac","family":"Antony","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,24]]},"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(1), 26 (2004). https:\/\/doi.org\/10.37236\/1779","DOI":"10.37236\/1779"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Bok, J., Jedlic\u0306kov\u00e1, N., Martin, B., Paulusma, D., Smith, S.: Acyclic, star and injective colouring: a complexity picture for H-free graphs. In: Grandoni, F., Herman, G., Sanders, P. (eds.) 28th Annual European Symposium on Algorithms (ESA 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 173, pp. 22:1\u201322:22. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ESA.2020.22","DOI":"10.4230\/LIPIcs.ESA.2020.22"},{"issue":"1","key":"7_CR3","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 problems. SIAM J. Numer. Anal. 20(1), 187\u2013209 (1983)","journal-title":"SIAM J. Numer. Anal."},{"issue":"4","key":"7_CR4","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1017\/S0963548398003678","volume":"7","author":"T Emden-Weinert","year":"1998","unstructured":"Emden-Weinert, T., Hougardy, S., Kreuter, B.: Uniquely colourable graphs and hardness of colouring graphs of large girth. Comb. Probab. Comput. 7(4), 375\u2013386 (1998). https:\/\/doi.org\/10.1017\/S0963548398003678","journal-title":"Comb. Probab. Comput."},{"issue":"3","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1137\/050639879","volume":"29","author":"AH Gebremedhin","year":"2007","unstructured":"Gebremedhin, A.H., Tarafdar, A., Manne, F., Pothen, A.: New acyclic and star coloring algorithms with application to computing Hessians. SIAM J. Sci. Comput. 29(3), 1042\u20131072 (2007). https:\/\/doi.org\/10.1137\/050639879","journal-title":"SIAM J. Sci. Comput."},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1137\/S0036144504444711","volume":"47","author":"AH Gebremedhin","year":"2005","unstructured":"Gebremedhin, A.H., Manne, F., Pothen, A.: What color is your Jacobian? Graph coloring for computing derivatives. SIAM Rev. 47(4), 629\u2013705 (2005). https:\/\/doi.org\/10.1137\/S0036144504444711","journal-title":"SIAM Rev."},{"key":"7_CR7","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/BF02764716","volume":"14","author":"B Gr\u00fcnbaum","year":"1973","unstructured":"Gr\u00fcnbaum, B.: Acyclic colorings of planar graphs. Israel J. Math. 14, 390\u2013408 (1973). https:\/\/doi.org\/10.1007\/BF02764716","journal-title":"Israel J. Math."},{"key":"7_CR8","unstructured":"mikero (https:\/\/cstheory.stackexchange.com\/users\/149\/mikero): Parameterized complexity from P to NP-hard and back again. Theoretical Computer Science Stack Exchange. https:\/\/cstheory.stackexchange.com\/q\/3473, (version: 13 April 2017)"},{"issue":"4","key":"7_CR9","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). https:\/\/doi.org\/10.1002\/jgt.22230","journal-title":"J. Graph Theory"},{"issue":"16","key":"7_CR10","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1016\/j.dam.2011.04.011","volume":"159","author":"A Lyons","year":"2011","unstructured":"Lyons, A.: Acyclic and star colorings of cographs. Discret. Appl. Math. 159(16), 1842\u20131850 (2011). https:\/\/doi.org\/10.1016\/j.dam.2011.04.011","journal-title":"Discret. Appl. Math."},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.jctb.2014.06.004","volume":"109","author":"M Molloy","year":"2014","unstructured":"Molloy, M., Reed, B.: Colouring graphs when the number of colours is almost the maximum degree. J. Comb. Theory Ser. B 109, 134\u2013195 (2014). https:\/\/doi.org\/10.1016\/j.jctb.2014.06.004","journal-title":"J. Comb. Theory Ser. B"},{"key":"7_CR12","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. Comb. 28(1) (2021). https:\/\/doi.org\/10.37236\/9202. Article No. 16","DOI":"10.37236\/9202"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Shalu, M.A., Antony, C.: The complexity of restricted star colouring. Discret. Appl. Math. (2021, in press). https:\/\/doi.org\/10.1016\/j.dam.2021.05.015. Available online: 31 May 2021","DOI":"10.1016\/j.dam.2021.05.015"},{"key":"7_CR14","volume-title":"Introduction to graph theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to graph theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"},{"issue":"12","key":"7_CR15","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1016\/j.ipl.2014.05.013","volume":"114","author":"D Xie","year":"2014","unstructured":"Xie, D., Xiao, H., Zhao, Z.: Star coloring of cubic graphs. Inf. Process. Lett. 114(12), 689\u2013691 (2014). https:\/\/doi.org\/10.1016\/j.ipl.2014.05.013","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95018-7_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,24]],"date-time":"2022-01-24T00:05:45Z","timestamp":1642982745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95018-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030950170","9783030950187"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95018-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"24 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Puducherry","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.acsdm.org\/caldam\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer OCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"80","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":"25","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":"31% - 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)"}},{"value":"Conference was held virtually.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}