{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:45:53Z","timestamp":1725500753419},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642360640"},{"type":"electronic","value":"9783642360657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36065-7_22","type":"book-chapter","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T16:36:53Z","timestamp":1358786213000},"page":"233-244","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Rainbow Connectivity of Graphs"],"prefix":"10.1007","author":[{"given":"Kei","family":"Uchizawa","sequence":"first","affiliation":[]},{"given":"Takanori","family":"Aoki","sequence":"additional","affiliation":[]},{"given":"Takehiro","family":"Ito","sequence":"additional","affiliation":[]},{"given":"Xiao","family":"Zhou","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1996","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM\u00a042, 844\u2013856 (1996)","journal-title":"J. ACM"},{"key":"22_CR2","unstructured":"Ananth, P., Mande, M., Sarpatwar, K.: Rainbow connectivity: hardness and tractability. In: Proc. of IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2011, pp. 241\u2013251 (2011)"},{"key":"22_CR3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719796","volume-title":"Graph Classes: A Survey","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph Classes: A Survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)"},{"key":"22_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. Combinatorial Optimization\u00a021, 330\u2013347 (2011)","journal-title":"J. Combinatorial Optimization"},{"key":"22_CR5","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1002\/jgt.20643","volume":"71","author":"L.S. Chandran","year":"2012","unstructured":"Chandran, L.S., Das, A., Rajendraprasad, D., Varma, N.M.: Rainbow connection number and connected dominating sets. J. Graph Theory\u00a071, 206\u2013218 (2012)","journal-title":"J. Graph Theory"},{"key":"22_CR6","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. Mathematica Bohemica\u00a0133, 85\u201398 (2008)","journal-title":"Mathematica Bohemica"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1002\/net.20296","volume":"54","author":"C. Chartrand","year":"2009","unstructured":"Chartrand, C., Johns, G.L., McKeon, K.A., Zhang, P.: The rainbow connectivity of a graph. Networks\u00a054, 75\u201381 (2009)","journal-title":"Networks"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Caro, Y., Lev, A., Roditty, Y., Tuza, Z., Yuster, R.: On rainbow connectivity. The Electronic J. Combinatorics\u00a015, R57 (2008)","DOI":"10.37236\/781"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"727","DOI":"10.1016\/j.jcss.2010.02.012","volume":"76","author":"M.R. Fellows","year":"2010","unstructured":"Fellows, M.R., Guo, J., Kanj, I.: The parameterized complexity of some minimum label problems. J. Computer and System Sciences\u00a076, 727\u2013740 (2010)","journal-title":"J. Computer and System Sciences"},{"key":"22_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1002\/jgt.20418","volume":"63","author":"M. Krivelevich","year":"2010","unstructured":"Krivelevich, M., Yuster, R.: The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory\u00a063, 185\u2013191 (2010)","journal-title":"J. Graph Theory"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Uchizawa, K., Aoki, T., Ito, T., Suzuki, A., Zhou, X.: On the rainbow connectivity of graphs: complexity and FPT algorithms. To appear in Algorithmica, doi:10.1007\/s00453-012-9689-4","DOI":"10.1007\/s00453-012-9689-4"}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36065-7_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,4]],"date-time":"2024-05-04T23:44:19Z","timestamp":1714866259000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36065-7_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642360640","9783642360657"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36065-7_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}