{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:22:41Z","timestamp":1725664961226},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606185"},{"type":"electronic","value":"9783540484875"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60618-1_62","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:48:39Z","timestamp":1330289319000},"page":"14-23","source":"Crossref","is-referenced-by-count":3,"title":["Finding and counting small induced subgraphs efficiently"],"prefix":"10.1007","author":[{"given":"T.","family":"Kloks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Kratsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"M\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"2_CR1","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1007\/BFb0049422","volume":"855","author":"N. Alon","year":"1994","unstructured":"Alon, N., R. Yuster and U. Zwick, Finding and counting given length cycles, Algorithms-ESA'94. Second Annual European Symposium, Springer-Verlag, Lecture Notes in Computer Science 855, (1994), pp. 354\u2013364.","journal-title":"Springer-Verlag, Lecture Notes in Computer Science"},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N. and T. Nishizeki, Arboricity and subgraph listing algorithms, SIAM J. Comput., 14, (1985), pp. 210\u2013223.","journal-title":"SIAM J. Comput."},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","volume":"4","author":"D. G. Corneil","year":"1985","unstructured":"Corneil, D. G., Y. Perl and L. K. Stewart, A linear recognition algorithm for cographs, SIAM J. Comput., 4, (1985), pp. 926\u2013934.","journal-title":"SIAM J. Comput."},{"key":"2_CR4","unstructured":"Faudree, R., E. Flandrin and Z. Ryj\u00e1\u010dek, Claw-free graphs-A survey. Manuscript."},{"key":"2_CR5","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary, F., Graph Theory, Addison Wesley, Publ. Comp., Reading, Massachusetts, (1969)."},{"key":"2_CR6","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1137\/0207033","volume":"7","author":"A. Itai","year":"1978","unstructured":"Itai, A. and M. Rodeh, Finding a minimum circuit in a graph, SIAM J. Comput., 7, (1978), pp. 413\u2013423.","journal-title":"SIAM J. Comput."},{"key":"2_CR7","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"G. J. Minty","year":"1980","unstructured":"Minty, G. J., On maximal independent sets of vertices in claw-free graphs, J. Combin. Theory B, 28, (1980), pp. 284\u2013304.","journal-title":"J. Combin. Theory B"},{"issue":"no.2","key":"2_CR8","first-page":"415","volume":"14","author":"J. Ne\u0161et\u0158il","year":"1985","unstructured":"Ne\u0161et\u0158il, J. and S. Poljak, On the complexity of the subgraph problem, Commentationes Mathematicae Universitatis Carolinae, 14 (1985), no. 2, pp. 415\u2013419.","journal-title":"Commentationes Mathematicae Universitatis Carolinae"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S. Olariu","year":"1988","unstructured":"Olariu, S., Paw-free graphs, Information Processing Letters, 28, (1988), pp. 53\u201354.","journal-title":"Information Processing Letters"},{"key":"2_CR10","first-page":"436","volume":"48","author":"P. Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P., Eine Extremalaufgabe aus der Graphentheorie, Mat. Fiz. Lapok, 48, (1941), pp. 436\u2013452.","journal-title":"Mat. Fiz. Lapok"},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(87)90048-7","volume":"42","author":"A. Tucker","year":"1987","unstructured":"Tucker, A., Coloring perfect K\n4 \u2014 e-free graphs, Journal of Combinatorial Theory, series B, 42, (1987), pp. 313\u2013318.","journal-title":"Journal of Combinatorial Theory, series B"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60618-1_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:26:22Z","timestamp":1619573182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60618-1_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606185","9783540484875"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-60618-1_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}