{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:10:02Z","timestamp":1725577802830},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642184680"},{"type":"electronic","value":"9783642184697"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-18469-7_21","type":"book-chapter","created":{"date-parts":[[2011,2,10]],"date-time":"2011-02-10T05:30:40Z","timestamp":1297315840000},"page":"226-237","source":"Crossref","is-referenced-by-count":2,"title":["A Computational Approach to Conway\u2019s Thrackle Conjecture"],"prefix":"10.1007","author":[{"given":"Radoslav","family":"Fulek","sequence":"first","affiliation":[]},{"given":"J\u00e1nos","family":"Pach","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0619-4","volume-title":"Modern Graph Theory","author":"B. Bollob\u00e1s","year":"1998","unstructured":"Bollob\u00e1s, B.: Modern Graph Theory. Springer, New York (1998)"},{"key":"21_CR2","volume-title":"Research Problems in Discrete Geometry","author":"P. Brass","year":"2005","unstructured":"Brass, P., Moser, W., Pach, J.: Research Problems in Discrete Geometry. Springer, New York (2005)"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/PL00009495","volume":"23","author":"G. Cairns","year":"2000","unstructured":"Cairns, G., Nikolayevsky, Y.: Bounds for generalized thrackles. Discrete Comput. Geom.\u00a023, 191\u2013206 (2000)","journal-title":"Discrete Comput. Geom."},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1090\/conm\/342\/06129","volume-title":"Towards a theory of Geometric Graphs, Contemp. Math. Amer. Math. Soc.,","author":"G. Cairns","year":"2004","unstructured":"Cairns, G., McIntyre, M., Nikolayevsky, Y.: The thrackle conjecture for $K\\sb 5$ and $K\\sb {3,3}$ . In: Towards a theory of Geometric Graphs, Contemp. Math. Amer. Math. Soc., vol.\u00a0342, pp. 35\u201354. RI, Providence (2004)"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s00454-008-9095-5","volume":"41","author":"G. Cairns","year":"2009","unstructured":"Cairns, G., Nikolayevsky, Y.: Generalized thrackle drawings of non-bipartite graphs. Discrete Comput. Geom.\u00a041, 119\u2013134 (2009)","journal-title":"Discrete Comput. Geom."},{"key":"21_CR6","volume-title":"Graph Theory","author":"R. Diestel","year":"2008","unstructured":"Diestel, R.: Graph Theory. Springer, New York (2008)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"de Fraysseix, H., de Mendez, P.O., Rosenstiehl, P.: Tr\u00e9maux Trees and Planarity. Internat. J. Found. of Comput. Sc.\u00a017, 1017\u20131030","DOI":"10.1142\/S0129054106004248"},{"key":"21_CR8","unstructured":"de Fraysseix, H., de Mendez, P.O.: Public Implementation of a Graph Algorithm Library and Editor, http:\/\/pigale.sourceforge.net\/"},{"key":"21_CR9","first-page":"999","volume-title":"Graph Theory, Combinatorics, and Algorithms","author":"J.E. Green","year":"1995","unstructured":"Green, J.E., Ringeisen, R.D.: Combinatorial drawings and thrackle surfaces. In: Graph Theory, Combinatorics, and Algorithms, Kalamazoo, MI, vol.\u00a02, pp. 999\u20131009. Wiley-Intersci. Publ., New York (1995)"},{"key":"21_CR10","first-page":"114","volume":"43","author":"H. Hopf","year":"1934","unstructured":"Hopf, H., Pannwitz, E.: Aufgabe Nr. 167. Jahresbericht Deutsch. Math.-Verein.\u00a043, 114 (1934)","journal-title":"Jahresbericht Deutsch. Math.-Verein."},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Hopcroft, J., Tarjan, R.E.: Efficient planarity testing. Journal of the Association for Computing Machinery\u00a021(4), 549\u2013568","DOI":"10.1145\/321850.321852"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/PL00009322","volume":"18","author":"L. Lov\u00e1sz","year":"1998","unstructured":"Lov\u00e1sz, L., Pach, J., Szegedy, M.: On Conway\u2019s thrackle conjecture. Discrete Comput. Geom.\u00a018, 369\u2013376 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00373-008-0796-6","volume":"24","author":"A. Perlstein","year":"2008","unstructured":"Perlstein, A., Pinchasi, R.: Generalized thrackles and geometric graphs in R 3 with no pair of strongly avoiding edges. Graphs Combin.\u00a024, 373\u2013389 (2008)","journal-title":"Graphs Combin."},{"key":"21_CR14","first-page":"265","volume":"127","author":"B.L. Piazza","year":"1994","unstructured":"Piazza, B.L., Ringeisen, R.D., Stueckle, S.K.: Subthrackleable graphs and four cycles. Graph theory and Applications (Hakone, 1990), Discrete Math\u00a0127, 265\u2013276 (1994)","journal-title":"Graph theory and Applications (Hakone, 1990), Discrete Math"},{"key":"21_CR15","first-page":"91","volume":"115","author":"R.D. Ringeisen","year":"1996","unstructured":"Ringeisen, R.D.: Two old extremal graph drawing conjectures: progress and perspectives. Congressus Numerantium\u00a0115, 91\u2013103 (1996)","journal-title":"Congressus Numerantium"},{"key":"21_CR16","unstructured":"Rosenstiehl, P.: Solution algebrique du probleme de Gauss sur la permutation des points d\u2019intersection d\u2019une ou plusieurs courbes fermees du plan. C. R. Acad. Sci. Paris Ser. A-B\u00a0283, A551\u2013A553 (1976)"},{"key":"21_CR17","first-page":"33","volume":"45","author":"J.W. Sutherland","year":"1935","unstructured":"Sutherland, J.W.: L\u00f6sung der Aufgabe 167. Jahresbericht Deutsch. Math.-Verein.\u00a045, 33\u201335 (1935)","journal-title":"Jahresbericht Deutsch. Math.-Verein."},{"key":"21_CR18","first-page":"335","volume-title":"Combinatorial Mathematics and Its Applications","author":"D.R. Woodall","year":"1969","unstructured":"Woodall, D.R.: Thrackles and deadlock. In: Welsh, D.J.A. (ed.) Combinatorial Mathematics and Its Applications, vol.\u00a0348, pp. 335\u2013348. Academic Press, London (1969)"},{"key":"21_CR19","unstructured":"Unsolved problems. Chairman: P. Erd\u0151s, in: Combinatorics Proc. Conf. Combinatorial Math., Math. Inst., Oxford, Inst. Math. Appl., Southend-on-Sea, 351\u2013363 (1972)"},{"key":"21_CR20","unstructured":"http:\/\/dcg.epfl.ch\/webdav\/site\/dcg\/users\/183292\/public\/Thrackle.zip"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-18469-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T12:44:51Z","timestamp":1559997891000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-18469-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642184680","9783642184697"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-18469-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}