{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:32Z","timestamp":1725564752109},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_25","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T21:16:57Z","timestamp":1283548617000},"page":"284-296","source":"Crossref","is-referenced-by-count":6,"title":["Short Cycles in Planar Graphs"],"prefix":"10.1007","author":[{"given":"\u0141ukasz","family":"Kowalik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding: a new method for finding simple paths, cycles and other small subgraphs within large graphs. In: Proc. 26th ACM Symp. on Theory of Computing, pp. 326\u2013335 (1994)","DOI":"10.1145\/195058.195179"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Yuster, R., Zwick, U.: Finding and counting given length cycles. In: Proc. European Symp. Algorithms, pp. 354\u2013364 (1994)","DOI":"10.1007\/BFb0049422"},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/0214017","volume":"14","author":"N. Chiba","year":"1985","unstructured":"Chiba, N., Nishizeki, T.: Arboricity and subgraph listing algorithms. SIAM J. Computing\u00a014, 210\u2013223 (1985)","journal-title":"SIAM J. Computing"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(91)90020-3","volume":"1991","author":"M. Chrobak","year":"1991","unstructured":"Chrobak, M., Eppstein, D.: Planar orientations with low out-degree and compaction of adjacency matrices. Theoretical Computer Science\u00a01991, 243\u2013266 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"25_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00014","volume":"3","author":"D. Eppstein","year":"1999","unstructured":"Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms and Applications\u00a03(3), 1\u201327 (1999)","journal-title":"J. Graph Algorithms and Applications"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1006\/eujc.2002.0570","volume":"23","author":"G. Fijavz","year":"2002","unstructured":"Fijavz, G., Juvan, M., Mohar, B., Skrekovski, R.: Planar graphs without cycles of specified lengths. European J. Combin.\u00a023, 377\u2013388 (2002)","journal-title":"European J. Combin."},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Kowalik, \u00a3., Kurowski, M.: Short path queries in planar graphs in constant time. In: Proc. 35th ACM Symp. on Theory of Computing, pp. 143\u2013148 (2003)","DOI":"10.1145\/780542.780565"},{"key":"25_CR8","first-page":"239","volume":"25","author":"B. Monien","year":"1985","unstructured":"Monien, B.: How to find long paths efficiently. Ann. Disc. Math.\u00a025, 239\u2013254 (1985)","journal-title":"Ann. Disc. Math."},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(81)90041-7","volume":"13","author":"C.H. Papadimitriou","year":"1981","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The clique problem for planar graphs. Inform. Proc. Lett.\u00a013, 131\u2013133 (1981)","journal-title":"Inform. Proc. Lett."},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/0196-6774(86)90029-5","volume":"7","author":"D. Richards","year":"1986","unstructured":"Richards, D.: Finding short cycles in planar graphs using separators. J. Algorithms\u00a07, 382\u2013394 (1986)","journal-title":"J. Algorithms"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/jctb.1995.1027","volume":"64","author":"C. Thomassen","year":"1995","unstructured":"Thomassen, C.: 3-list coloring planar graphs of girth 5. Journal of Combinatorial Theory, Series B\u00a064, 101\u2013107 (1995)","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\/978-3-540-39890-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T09:18:59Z","timestamp":1559553539000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}