{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:45:31Z","timestamp":1725518731008},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540874041"},{"type":"electronic","value":"9783540874058"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-87405-8_26","type":"book-chapter","created":{"date-parts":[[2008,9,17]],"date-time":"2008-09-17T06:48:17Z","timestamp":1221634097000},"page":"379-395","source":"Crossref","is-referenced-by-count":1,"title":["On Switching to H-Free Graphs"],"prefix":"10.1007","author":[{"given":"Eva","family":"Jel\u00ednkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/S0020-0190(00)00020-X","volume":"73","author":"A. Ehrenfeucht","year":"2000","unstructured":"Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Pancyclicity in switching classes. Inform. Process. Letters\u00a073, 153\u2013156 (2000)","journal-title":"Inform. Process. Letters"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-540-46464-8_5","volume-title":"Theory and Application of Graph Transformations","author":"A. Ehrenfeucht","year":"2000","unstructured":"Ehrenfeucht, A., Hage, J., Harju, T., Rozenberg, G.: Complexity issues in switching classes. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 59\u201370. Springer, Heidelberg (2000)"},{"key":"26_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"26_CR4","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1137\/S0895480100381890","volume":"18","author":"J. Hage","year":"2004","unstructured":"Hage, J., Harju, T.: A characterization of acyclic switching classes of graphs using forbidden subgraphs. SIAM J. Discrete Math.\u00a018, 159\u2013176 (2004)","journal-title":"SIAM J. Discrete Math."},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1007\/3-540-45832-8_13","volume-title":"Graph Transformation","author":"J. Hage","year":"2002","unstructured":"Hage, J., Harju, T., Welzl, E.: Euler graphs, triangle-free graphs and bipartite graphs in switching classes. In: Corradini, A., Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) ICGT 2002. LNCS, vol.\u00a02505, pp. 148\u2013160. Springer, Heidelberg (2002)"},{"key":"26_CR6","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1006\/jctb.1996.0018","volume":"66","author":"R.B. Hayward","year":"1996","unstructured":"Hayward, R.B.: Recognizing P 3-structure: A switching approach. J. Combin. Th. Ser. B\u00a066, 247\u2013262 (1996)","journal-title":"J. Combin. Th. Ser. B"},{"key":"26_CR7","unstructured":"Herman, J.: Computational Complexity in Graph Theory, master thesis, Charles University in Prague (2006)"},{"key":"26_CR8","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00153-X","volume":"94","author":"A. Hertz","year":"1999","unstructured":"Hertz, A.: On perfect switching classes. Discrete Appl. Math.\u00a094, 3\u20137 (1999)","journal-title":"Discrete Appl. Math."},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J., Z\u00fdka, O.: On the computational complexity of Seidel\u2019s switching. In: Proc. 4th Czech. Symp., Prachatice 1990, Ann. Discrete Math., vol.\u00a051, pp. 161\u2013166 (1992)","DOI":"10.1016\/S0167-5060(08)70622-8"},{"key":"26_CR10","first-page":"755","volume":"30","author":"J. Kratochv\u00edl","year":"1989","unstructured":"Kratochv\u00edl, J.: Perfect codes and two-graphs. Comment. Math. Univ. Carolin.\u00a030, 755\u2013760 (1989)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-3-540-39890-5_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kratochv\u00edl","year":"2003","unstructured":"Kratochv\u00edl, J.: Complexity of hypergraph coloring and Seidel\u2019s switching. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 297\u2013308. Springer, Heidelberg (2003)"},{"key":"26_CR12","unstructured":"Seidel, J.J.: Graphs and two-graphs. In: Proc. 5th. Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Winnipeg, Canada (1974)"},{"key":"26_CR13","first-page":"481","volume-title":"Teorie combinatorie, Atti Conv. Lincei","author":"J.J. Seidel","year":"1973","unstructured":"Seidel, J.J.: A survey of two-graphs. In: Teorie combinatorie, Atti Conv. Lincei, vol.\u00a017, pp. 481\u2013511. Academia Nazionale dei Lincei, Rome (1973)"},{"key":"26_CR14","unstructured":"Seidel, J.J., Taylor, D.E.: Two-graphs, a second survey. In: Algebraic methods in graph theory, vol. II, Conf. Szeged 1978, Colloq. Math. Janos Bolyai, vol.\u00a025, pp. 689\u2013711 (1981)"}],"container-title":["Lecture Notes in Computer Science","Graph Transformations"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87405-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:37:36Z","timestamp":1606167456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87405-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540874041","9783540874058"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87405-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}