{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T09:11:50Z","timestamp":1777540310367,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319774039","type":"print"},{"value":"9783319774046","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-77404-6_46","type":"book-chapter","created":{"date-parts":[[2018,3,12]],"date-time":"2018-03-12T10:03:11Z","timestamp":1520848991000},"page":"625-639","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithms and Bounds for Very Strong Rainbow Coloring"],"prefix":"10.1007","author":[{"given":"L. Sunil","family":"Chandran","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anita","family":"Das","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5559-7471","authenticated-orcid":false,"given":"Davis","family":"Issac","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erik Jan","family":"van Leeuwen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,13]]},"reference":[{"key":"46_CR1","unstructured":"Ananth, P., Nasre, M., Sarpatwar, K.K.: Rainbow connectivity: Hardness and tractability. In: Chakraborty, S., Kumar, A. (eds.) Proceedings of FSTTCS 2011. LIPIcs, vol. 13, pp. 241\u2013251. Schloss Dagstuhl (2011)"},{"issue":"2","key":"46_CR2","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s00373-012-1267-7","volume":"30","author":"M Basavaraju","year":"2014","unstructured":"Basavaraju, M., Chandran, L.S., Rajendraprasad, D., Ramaswamy, A.: Rainbow connection number and radius. Graphs Comb. 30(2), 275\u2013285 (2014)","journal-title":"Graphs Comb."},{"key":"46_CR3","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput. 39, 546\u2013563 (2009)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"46_CR4","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/s10878-009-9250-9","volume":"21","author":"S Chakraborty","year":"2011","unstructured":"Chakraborty, S., Fischer, E., Matsliah, A., Yuster, R.: Hardness and algorithms for rainbow connection. J. Comb. Optim. 21(3), 330\u2013347 (2011)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"46_CR5","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1002\/jgt.20643","volume":"71","author":"LS Chandran","year":"2012","unstructured":"Chandran, L.S., Das, A., Rajendraprasad, D., Varma, N.M.: Rainbow connection number and connected dominating sets. J. Graph Theory 71(2), 206\u2013218 (2012)","journal-title":"J. Graph Theory"},{"key":"46_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/978-3-642-32241-9_16","volume-title":"Computing and Combinatorics","author":"LS Chandran","year":"2012","unstructured":"Chandran, L.S., Rajendraprasad, D.: Rainbow colouring of split and threshold graphs. In: Gudmundsson, J., Mestre, J., Viglas, T. (eds.) COCOON 2012. LNCS, vol. 7434, pp. 181\u2013192. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32241-9_16"},{"key":"46_CR7","unstructured":"Chandran, L.S., Rajendraprasad, D.: Inapproximability of rainbow colouring. In: Seth, A., Vishnoi, N.K. (eds.) Proceedings of FSTTCS 2013. LIPIcs, vol. 24, pp. 153\u2013162. Schloss Dagstuhl (2013)"},{"issue":"1","key":"46_CR8","doi-asserted-by":"crossref","first-page":"85","DOI":"10.21136\/MB.2008.133947","volume":"133","author":"G Chartrand","year":"2008","unstructured":"Chartrand, G., Johns, G.L., McKeon, K.A., Zhang, P.: Rainbow connection in graphs. Math. Bohem. 133(1), 85\u201398 (2008)","journal-title":"Math. Bohem."},{"key":"46_CR9","doi-asserted-by":"publisher","unstructured":"Eiben, E., Ganian, R., Lauri, J.: On the complexity of rainbow coloring problems. Discret. Appl. Math. (2016, in press). https:\/\/doi.org\/10.1016\/j.dam.2016.10.021","DOI":"10.1016\/j.dam.2016.10.021"},{"issue":"106\u2013112","key":"46_CR10","first-page":"86","volume":"18","author":"P Erd\u0151s","year":"1966","unstructured":"Erd\u0151s, P., Goodman, A.W., P\u00f3sa, L.: The representation of a graph by set intersections. Canad. J. Math 18(106\u2013112), 86 (1966)","journal-title":"Canad. J. Math"},{"key":"46_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Gary","year":"1979","unstructured":"Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)"},{"issue":"1","key":"46_CR12","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0095-8956(74)90094-X","volume":"16","author":"F Gavril","year":"1974","unstructured":"Gavril, F.: The intersection graphs of subtrees in trees are exactly the chordal graphs. JCTB 16(1), 47\u201356 (1974)","journal-title":"JCTB"},{"issue":"2","key":"46_CR13","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/s00453-012-9671-1","volume":"68","author":"F Kammer","year":"2014","unstructured":"Kammer, F., Tholey, T.: Approximation algorithms for intersection graphs. Algorithmica 68(2), 312\u2013336 (2014)","journal-title":"Algorithmica"},{"key":"46_CR14","unstructured":"Keranen, M., Lauri, J.: Computing minimum rainbow and strong rainbow colorings of block graphs. arXiv preprint arXiv:1405.6893 (2014)"},{"key":"46_CR15","unstructured":"Kowalik, \u0141., Lauri, J., Socala, A.: On the fine-grained complexity of rainbow coloring. In: Sankowski, P., Zaroliagis, C.D. (eds.) Proceedings of ESA 2016. LIPIcs, vol. 57, pp. 58:1\u201358:16. Schloss Dagstuhl (2016)"},{"key":"46_CR16","volume-title":"Chasing the Rainbow Connection: Hardness, Algorithms, and Bounds","author":"J Lauri","year":"2016","unstructured":"Lauri, J.: Chasing the Rainbow Connection: Hardness, Algorithms, and Bounds, vol. 1428. Tampere University of Technology Publication, Tampere (2016)"},{"issue":"1","key":"46_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-012-1243-2","volume":"29","author":"X Li","year":"2013","unstructured":"Li, X., Shi, Y., Sun, Y.: Rainbow connections of graphs: a survey. Graphs Comb. 29(1), 1\u201338 (2013)","journal-title":"Graphs Comb."},{"key":"46_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3119-0","volume-title":"Rainbow Connections of Graphs","author":"X Li","year":"2012","unstructured":"Li, X., Sun, Y.: Rainbow Connections of Graphs. Springer Science & Business Media, Boston (2012). https:\/\/doi.org\/10.1007\/978-1-4614-3119-0"},{"key":"46_CR19","first-page":"3","volume":"0","author":"X Li","year":"2017","unstructured":"Li, X., Sun, Y.: An updated survey on rainbow connections of graphs - a dynamic survey. Theory Appl. Graphs 0, 3 (2017)","journal-title":"Theory Appl. Graphs"},{"issue":"1","key":"46_CR20","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0166-218X(85)90061-7","volume":"10","author":"FS Roberts","year":"1985","unstructured":"Roberts, F.S.: Applications of edge coverings by cliques. Discret. Appl. Math. 10(1), 93\u2013109 (1985)","journal-title":"Discret. Appl. Math."},{"key":"46_CR21","first-page":"309","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. II. Algorithmic aspects of tree-width. JCTB 7, 309\u2013322 (1986)","journal-title":"JCTB"},{"issue":"2","key":"46_CR22","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00453-012-9689-4","volume":"67","author":"K Uchizawa","year":"2013","unstructured":"Uchizawa, K., Aoki, T., Ito, T., Suzuki, A., Zhou, X.: On the rainbow connectivity of graphs: complexity and FPT algorithms. Algorithmica 67(2), 161\u2013179 (2013)","journal-title":"Algorithmica"},{"key":"46_CR23","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of STOC 2006, pp. 681\u2013690. ACM (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","LATIN 2018: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77404-6_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:04:18Z","timestamp":1709827458000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77404-6_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774039","9783319774046"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77404-6_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"13 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Buenos Aires","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Argentina","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/latin2018.dc.uba.ar\/#","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}