{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T07:52:48Z","timestamp":1794383568697,"version":"4.9.0"},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"value":"9780387307688","type":"print"},{"value":"9780387301648","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-0-387-30164-8_352","type":"book-chapter","created":{"date-parts":[[2010,12,29]],"date-time":"2010-12-29T12:43:13Z","timestamp":1293626593000},"page":"479-482","source":"Crossref","is-referenced-by-count":0,"title":["Graphs"],"prefix":"10.1007","author":[{"given":"Tommy R.","family":"Jensen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"352_CR1_352","unstructured":"Bang-Jensen, J., & Gutin, G. (2000). Digraphs: theory, algorithms and applications. Springer monographs in mathematics, London: Springer. http:\/\/www.imada.sdu.dk\/Research\/Digraphs\/"},{"key":"352_CR2_352","unstructured":"Berge, C. (1976). Graphs and hypergraphs. North-Holland mathematical library (Vol. 6)."},{"key":"352_CR3_352","unstructured":"Bishop, C. M. (2006). Pattern recognition and machine learning. Springer."},{"key":"352_CR4_352","doi-asserted-by":"crossref","unstructured":"Bondy, J. A., & Murty, U. S. R. (2007) Graph theory, Springer.","DOI":"10.1007\/978-3-7643-7400-6"},{"key":"352_CR5_352","doi-asserted-by":"publisher","first-page":"51","DOI":"10.4007\/annals.2006.164.51","volume":"164","author":"M Chudnovsky","year":"2006","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P., & Thomas, R. (2006). The strong perfect graph theorem. Annals of Mathematics, 164, 51\u2013229.","journal-title":"Annals of Mathematics"},{"key":"352_CR6_352","unstructured":"Diestel,\u00a0R.\u00a0(2005). Graph theory (3rd\u00a0ed.). Springer. http:\/\/www.math.uni-hamburg.de\/home\/diestel\/books\/graph.theory\/GraphTheoryIII.pdf"},{"key":"352_CR7_352","unstructured":"Emden-Weinert, T. Graphs: theory\u2013algorithms\u2013complexity. http:\/\/people.freenet.de\/Emden-Weinert\/graphs.html."},{"key":"352_CR8_352","volume-title":"Computers and Intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and Intractability: A guide to the theory of NP-completeness. New York: Freeman."},{"key":"352_CR9_352","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M. R., Johnson, D. S., & Stockmeyer, L. J. (1976). Some simplified NP-complete graph problems. Theoretical Computer Science, 1, 237\u2013267.","journal-title":"Theoretical Computer Science"},{"key":"352_CR10_352","unstructured":"Gimbel, J., Kennedy, J. W., & Quintas, L. V. (Eds.). (1993). Quo Vadis, graph theory? North-Holland."},{"key":"352_CR11_352","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F Harary","year":"1969","unstructured":"Harary, F. (1969). Graph theory. Reading: Addison-Wesley."},{"key":"352_CR12_352","doi-asserted-by":"crossref","unstructured":"Jensen, T. R., & Toft, B. (1995). Graph coloring problems. Wiley.","DOI":"10.1002\/9781118032497"},{"key":"352_CR13_352","unstructured":"Locke, S. C. Graph theory. http:\/\/www.math.fau.edu\/locke\/graphthe.htm."},{"key":"352_CR14_352","unstructured":"Lov\u00e1sz, L., & Plummer, M. D. (1986). Matching theory. Annals of discrete math (Vol. 29). North Holland."},{"key":"352_CR15_352","doi-asserted-by":"crossref","unstructured":"Mohar, B., & Thomassen, C. (2001). Graphs on surfaces. John Hopkins University\u00a0Press.","DOI":"10.56021\/9780801866890"},{"key":"352_CR16_352","doi-asserted-by":"crossref","unstructured":"Robertson, N., & Seymour, P. D. (2004). Graph minors. XX. Wagner\u2019s conjecture. Journal of Combinatorial Theory, Series B, 92(2), 325\u2013357.","DOI":"10.1016\/j.jctb.2004.08.001"},{"key":"352_CR17_352","unstructured":"Weisstein, E. W. Books about graph theory. http:\/\/www.ericweisstein.com\/encyclopedias\/books\/GraphTheory.html."}],"container-title":["Encyclopedia of Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-0-387-30164-8_352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T22:23:13Z","timestamp":1703197393000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-0-387-30164-8_352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9780387307688","9780387301648"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-0-387-30164-8_352","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-0-387-30164-8","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011]]}}}