{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:30:14Z","timestamp":1725489014530},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540433095"},{"type":"electronic","value":"9783540458487"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45848-4_7","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T14:47:53Z","timestamp":1186843673000},"page":"84-95","source":"Crossref","is-referenced-by-count":1,"title":["A Characterization of DFS Cotree Critical Graphs"],"prefix":"10.1007","author":[{"given":"Hubert","family":"de Fraysseix","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrice","family":"Ossona de Mendez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"key":"7_CR1","unstructured":"H. de Fraysseix and P. Ossona de Mendez, An algorithm to find Kuratowski subdivision in DFS cotree critical graphs, Proceedings of the twelfth australasian workshop on combinatorial algorithms (Edy Try Baskoro, ed.), Institut Teknologi Bandung, Indonesia, 2001."},{"key":"7_CR2","first-page":"214","volume":"1018","author":"H. Fraysseix de","year":"1981","unstructured":"H. de Fraysseix and P. Rosenstiehl, A discriminatory theorem of Kuratowski subgraphs, Lecture Notes in Mathematics 1018 (1981), 214\u2013222.","journal-title":"A discriminatory theorem of Kuratowski subgraphs"},{"key":"7_CR3","unstructured":"-, A characterization of planar graphs by Tr\u00e9maux orders, Combinatorica 5 (1985), no. 2, 127\u2013135."},{"key":"7_CR4","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1145\/321850.321852","volume":"21","author":"J.E. Hopcroft","year":"1974","unstructured":"J.E Hopcroft and R.E. Tarjan, Efficient planarity testing, J. Assoc. Comput. Math. 21 (1974), 549\u2013568.","journal-title":"J. Assoc. Comput. Math."},{"key":"7_CR5","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"K. Kuratowski","year":"1930","unstructured":"K. Kuratowski, Sur le probl\u00e8me des courbes gauches en topologie, Fund. Math. 15 (1930), 271\u2013293.","journal-title":"Fund. Math."},{"key":"7_CR6","unstructured":"W.T. Tutte, Graph theory, Encyclopedia of Mathematics and its applications, vol. 21, Addison-Wesley, 1984."},{"issue":"4","key":"7_CR7","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1145\/1634.322451","volume":"31","author":"S.G. Williamson","year":"1984","unstructured":"S.G. Williamson, Depth-first search and kuratowski subgraphs, Journal of the ACM 31 (1984), no. 4, 681\u2013693.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45848-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T12:09:47Z","timestamp":1550750987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45848-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540433095","9783540458487"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-45848-4_7","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}