{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T16:45:40Z","timestamp":1791823540673,"version":"4.3.4"},"publisher-location":"Boston, MA","reference-count":17,"publisher":"Springer US","isbn-type":[{"value":"9781489976857","type":"print"},{"value":"9781489976871","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"vor","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":[[2017]]},"DOI":"10.1007\/978-1-4899-7687-1_352","type":"book-chapter","created":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T18:42:06Z","timestamp":1591036926000},"page":"592-596","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","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","published-online":{"date-parts":[[2017,4,14]]},"reference":[{"key":"352_CR7156","unstructured":"Bang-Jensen J, Gutin G (2000) Digraphs: theory, algorithms and applications. Springer monographs in mathematics. Springer, London. http:\/\/www.imada.sdu.dk\/Research\/Digraphs\/"},{"key":"352_CR7157","unstructured":"Berge C (1976) Graphs and hypergraphs. North-Holland mathematical library, vol\u00a06. North-Holland Publishing Company, Amsterdam"},{"key":"352_CR7158","volume-title":"Pattern recognition and machine learning","author":"CM Bishop","year":"2006","unstructured":"Bishop CM (2006) Pattern recognition and machine learning. Springer, New York"},{"key":"352_CR7159","volume-title":"Graph theory","author":"JA Bondy","year":"2007","unstructured":"Bondy JA, Murty USR (2007) Graph theory. Springer"},{"key":"352_CR7160","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. Ann Math 164:51\u2013229","journal-title":"Ann Math"},{"key":"352_CR7161","unstructured":"Diestel R (2005) Graph theory, 3rd edn. Springer. http:\/\/www.math.uni - hamburg.de\/home\/diestel\/books\/graph.theory\/GraphTheoryIII.pdf"},{"key":"352_CR7162","unstructured":"Emden-Weinert T. Graphs: theory\u2013algorithms\u2013complexity. http:\/\/people.freenet.de\/Emden-Weinert\/graphs.html"},{"key":"352_CR7163","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"352_CR7164","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey MR, Johnson DS, Stockmeyer LJ (1976) Some simplified NP-complete graph problems. Theor Comput Sci 1:237\u2013267","journal-title":"Theor Comput Sci"},{"key":"352_CR7165","volume-title":"Quo vadis, graph theory?","year":"1993","unstructured":"Gimbel J, Kennedy JW, Quintas LV (eds) (1993) Quo vadis, graph theory? North-Holland, Amsterdam\/ New York"},{"key":"352_CR7166","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F Harary","year":"1969","unstructured":"Harary F (1969) Graph theory. Addison-Wesley, Reading"},{"key":"352_CR7167","volume-title":"Graph coloring problems","author":"TR Jensen","year":"1995","unstructured":"Jensen TR, Toft B (1995) Graph coloring problems. Wiley, New York"},{"key":"352_CR7168","unstructured":"Locke SC. Graph theory. http:\/\/www.math.fau.edu\/locke\/graphthe.htm"},{"key":"352_CR7169","unstructured":"Lov\u00e1sz L, Plummer MD (1986) Matching theory. Annals of discrete mathematics, vol\u00a029. North Holland, Amsterdam\/New York"},{"key":"352_CR7170","doi-asserted-by":"crossref","DOI":"10.56021\/9780801866890","volume-title":"Graphs on surfaces","author":"B Mohar","year":"2001","unstructured":"Mohar B, Thomassen C (2001) Graphs on surfaces. John Hopkins University Press, Baltimore"},{"issue":"2","key":"352_CR7171","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.jctb.2004.08.001","volume":"92","author":"N Robertson","year":"2004","unstructured":"Robertson N, Seymour PD (2004) Graph minors. XX. Wagner\u2019s conjecture. J Comb Theory Ser B 92(2): 325\u2013357","journal-title":"XX. Wagner\u2019s conjecture. J Comb Theory Ser B"},{"key":"352_CR7172","unstructured":"Weisstein EW. Books about graph theory. http:\/\/www.ericweisstein.com\/encyclopedias\/books\/GraphTheory.html"}],"container-title":["Encyclopedia of Machine Learning and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4899-7687-1_352","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,12]],"date-time":"2026-10-12T15:55:16Z","timestamp":1791820516000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4899-7687-1_352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9781489976857","9781489976871"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-1-4899-7687-1_352","relation":{},"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"14 April 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}