{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T23:16:19Z","timestamp":1742944579493,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642329722"},{"type":"electronic","value":"9783642329739"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32973-9_2","type":"book-chapter","created":{"date-parts":[[2012,8,29]],"date-time":"2012-08-29T14:44:22Z","timestamp":1346251462000},"page":"12-21","source":"Crossref","is-referenced-by-count":0,"title":["An Algebraic Characterization of Rainbow Connectivity"],"prefix":"10.1007","author":[{"given":"Prabhanjan","family":"Ananth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ambedkar","family":"Dukkipati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1&2","key":"2_CR1","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1017\/S0963548398003411","volume":"8","author":"N. Alon","year":"1999","unstructured":"Alon, N.: Combinatorial Nullstellensatz. Combinatorics, Probability and Computing\u00a08(1&2), 7\u201329 (1999)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"1-3","key":"2_CR2","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/0012-365X(92)00057-X","volume":"124","author":"L. Lov\u00e1sz","year":"1994","unstructured":"Lov\u00e1sz, L.: Stable sets and polynomials. Discrete Mathematics\u00a0124(1-3), 137\u2013153 (1994)","journal-title":"Discrete Mathematics"},{"issue":"1","key":"2_CR3","first-page":"89","volume":"36","author":"J. De Loera","year":"1995","unstructured":"De Loera, J.: Gr\u00f6bner bases and graph colorings. Beitr\u00e4ge Algebra Geom.\u00a036(1), 89\u201396 (1995)","journal-title":"Beitr\u00e4ge Algebra Geom."},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"De Loera, J., Lee, J., Malkin, P., Margulies, S.: Hilbert\u2019s Nullstellensatz and an algorithm for proving combinatorial infeasibility. In: ISSAC 2008: Proceedings of the Twenty-first International Symposium on Symbolic and Algebraic Computation, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1390768.1390797"},{"key":"2_CR5","unstructured":"Margulies, S.: Computer algebra, combinatorics, and complexity: Hilberts Nullstellensatz and NP-complete problems. PhD thesis, University of California (2008)"},{"key":"2_CR6","unstructured":"Bayer, D.: The division algorithm and the Hilbert scheme. PhD thesis, Harvard University (1982)"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms, 3rd edn. Undergraduate Texts in Mathematics. Springer (2007)","DOI":"10.1007\/978-0-387-35651-8"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Koll\u00e1r, J.: Sharp effective Nullstellensatz. American Mathematical Society 1(4) (1988)","DOI":"10.2307\/1990996"},{"issue":"3","key":"2_CR9","doi-asserted-by":"publisher","first-page":"577","DOI":"10.2307\/1971361","volume":"126","author":"W. Brownawell","year":"1987","unstructured":"Brownawell, W.: Bounds for the degrees in the Nullstellensatz. The Annals of Mathematics\u00a0126(3), 577\u2013591 (1987)","journal-title":"The Annals of Mathematics"},{"issue":"04","key":"2_CR10","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1017\/S0963548309009894","volume":"18","author":"J. Loera","year":"2009","unstructured":"Loera, J., Lee, J., Margulies, S., Onn, S.: Expressing combinatorial problems by systems of polynomial equations and hilberts nullstellensatz. Combinatorics, Probability and Computing\u00a018(04), 551\u2013582 (2009)","journal-title":"Combinatorics, Probability and Computing"},{"issue":"1","key":"2_CR11","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., McKeon, K., Zhang, P.: Rainbow connection in graphs. Math. Bohem\u00a0133(1), 85\u201398 (2008)","journal-title":"Math. Bohem"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1006\/jctb.1997.1753","volume":"70","author":"N. Alon","year":"1997","unstructured":"Alon, N., Tarsi, M.: A note on graph colorings and graph polynomials. Journal of Combinatorial Theory Series B\u00a070, 197\u2013201 (1997)","journal-title":"Journal of Combinatorial Theory Series B"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32973-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T05:36:07Z","timestamp":1676784967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-32973-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642329722","9783642329739"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32973-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}