{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:47:05Z","timestamp":1752983225101,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030392185"},{"type":"electronic","value":"9783030392192"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39219-2_1","type":"book-chapter","created":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:09:24Z","timestamp":1579910964000},"page":"3-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Complexity of Restricted Variant of Star Colouring"],"prefix":"10.1007","author":[{"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":[[2020,1,24]]},"reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"crossref","first-page":"26","DOI":"10.37236\/1779","volume":"11","author":"MO Albertson","year":"2004","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)","journal-title":"Electron. J. Comb."},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00373-018-1979-4","volume":"35","author":"J Almeter","year":"2019","unstructured":"Almeter, J., Demircan, S., Kallmeyer, A., Milans, K.G., Winslow, R.: Graph 2-rankings. Graphs Comb. 35(1), 91\u2013102 (2019). https:\/\/doi.org\/10.1007\/s00373-018-1979-4","journal-title":"Graphs Comb."},{"issue":"1","key":"1_CR3","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1137\/S0895480195282550","volume":"11","author":"HL Bodlaender","year":"1998","unstructured":"Bodlaender, H.L., et al.: Rankings of graphs. SIAM J. Discrete Math. 11(1), 168\u2013181 (1998). https:\/\/doi.org\/10.1137\/S0895480195282550","journal-title":"SIAM J. Discrete Math."},{"issue":"4","key":"1_CR4","doi-asserted-by":"publisher","first-page":"2418","DOI":"10.1137\/080732158","volume":"32","author":"D Bozda\u011f","year":"2010","unstructured":"Bozda\u011f, D., \u00c7ataly\u00fcrek, \u00dc.V., Gebremedhin, A.H., Manne, F., Boman, E.G., \u00d6zg\u00fcner, F.: Distributed-memory parallel algorithms for distance-2 coloring and related problems in derivative computation. SIAM J. Sci. Comput. 32(4), 2418\u20132446 (2010). https:\/\/doi.org\/10.1137\/080732158","journal-title":"SIAM J. Sci. Comput."},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1093\/imamat\/13.1.117","volume":"13","author":"AR Curtis","year":"1974","unstructured":"Curtis, A.R., Powell, M.J., Reid, J.K.: On the estimation of sparse Jacobian matrices. J. Inst. Math. Appl. 13(1), 117\u2013120 (1974). https:\/\/doi.org\/10.1093\/imamat\/13.1.117","journal-title":"J. Inst. Math. Appl."},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Dereniowski, D.: Rank coloring of graphs. In: Kubale, M. (ed.) Graph Colorings, pp. 79\u201393, Chap. 6. American Mathematical Society (2004). https:\/\/doi.org\/10.1090\/conm\/352\/06","DOI":"10.1090\/conm\/352\/06"},{"issue":"1","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2513109.2513110","volume":"40","author":"Assefaw H. Gebremedhin","year":"2013","unstructured":"Gebremedhin, A., Nguyen, D., Patwary, M.M.A., Pothen, A.: ColPack: software for graph coloring and related problems in scientific computing. ACM Trans. Math. Softw. (TOMS) 40 (2013). https:\/\/doi.org\/10.1145\/2513109.2513110","journal-title":"ACM Transactions on Mathematical Software"},{"issue":"4","key":"1_CR8","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."},{"issue":"8","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1460","DOI":"10.1016\/j.disc.2015.03.008","volume":"338","author":"I Karpas","year":"2015","unstructured":"Karpas, I., Neiman, O., Smorodinsky, S.: On vertex rankings of graphs and its relatives. Discrete Math. 338(8), 1460\u20131467 (2015). https:\/\/doi.org\/10.1016\/j.disc.2015.03.008","journal-title":"Discrete Math."},{"issue":"1\u20133","key":"1_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0012-365X(93)E0216-Q","volume":"142","author":"M Katchalski","year":"1995","unstructured":"Katchalski, M., McCuaig, W., Seager, S.: Ordered colourings. Discrete Math. 142(1\u20133), 141\u2013154 (1995). https:\/\/doi.org\/10.1016\/0012-365X(93)E0216-Q","journal-title":"Discrete Math."},{"issue":"16","key":"1_CR11","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. Discrete Appl. Math. 159(16), 1842\u20131850 (2011). https:\/\/doi.org\/10.1016\/j.dam.2011.04.011","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/s00454-001-0047-6","volume":"26","author":"C Moore","year":"2001","unstructured":"Moore, C., Robson, J.M.: Hard tiling problems with simple tiles. Discrete Comput. Geom. 26(4), 573\u2013590 (2001). https:\/\/doi.org\/10.1007\/s00454-001-0047-6","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1060","DOI":"10.1137\/0716078","volume":"16","author":"M Powell","year":"1979","unstructured":"Powell, M., Toint, P.L.: On the estimation of sparse Hessian matrices. SIAM J. Numer. Anal. 16(6), 1060\u20131074 (1979). https:\/\/doi.org\/10.1137\/0716078","journal-title":"SIAM J. Numer. Anal."},{"key":"1_CR14","unstructured":"Scheffler, P.: Node ranking and searching on graphs. In: 3rd Twente Workshop on Graphs and Combinatorial Optimization, Memorandum No. 1132 (1993)"},{"issue":"5","key":"1_CR15","doi-asserted-by":"publisher","first-page":"2121","DOI":"10.1007\/s00373-016-1702-2","volume":"32","author":"MA Shalu","year":"2016","unstructured":"Shalu, M.A., Sandhya, T.P.: Star coloring of graphs with girth at least five. Graphs Comb. 32(5), 2121\u20132134 (2016). https:\/\/doi.org\/10.1007\/s00373-016-1702-2","journal-title":"Graphs Comb."},{"key":"1_CR16","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"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39219-2_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T22:42:13Z","timestamp":1614120133000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39219-2_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030392185","9783030392192"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39219-2_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"24 January 2020","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":"Hyderabad","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 February 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iith.ac.in\/~caldam2020\/index.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}