{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:25:05Z","timestamp":1725582305843},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642208768"},{"type":"electronic","value":"9783642208775"}],"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-20877-5_45","type":"book-chapter","created":{"date-parts":[[2011,4,27]],"date-time":"2011-04-27T02:35:17Z","timestamp":1303871717000},"page":"463-470","source":"Crossref","is-referenced-by-count":0,"title":["Switching to Hedgehog-Free Graphs Is NP-Complete"],"prefix":"10.1007","author":[{"given":"Eva","family":"Jel\u00ednkov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_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":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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 of graphs. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol.\u00a01764, pp. 59\u201370. Springer, Heidelberg (2000)"},{"key":"45_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 and Company, New York (1979)"},{"key":"45_CR4","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":"45_CR5","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\n                    3-structure: A switching approach. J. Combin. Th. Ser. B\u00a066, 247\u2013262 (1996)","journal-title":"J. Combin. Th. Ser. B"},{"key":"45_CR6","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":"45_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-87405-8_26","volume-title":"Graph Transformations","author":"E. Jel\u00ednkov\u00e1","year":"2008","unstructured":"Jel\u00ednkov\u00e1, E., Kratochv\u00edl, J.: On Switching to H-Free Graphs. In: Ehrig, H., Heckel, R., Rozenberg, G., Taentzer, G. (eds.) ICGT 2008. LNCS, vol.\u00a05214, pp. 379\u2013395. Springer, Heidelberg (2008)"},{"key":"#cr-split#-45_CR8.1","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J., Z\u00fdka, O.: On the computational complexity of Seidel's switching. In: Proc. 4th Czech. Symp., Prachatice (1990)"},{"key":"#cr-split#-45_CR8.2","doi-asserted-by":"crossref","unstructured":"Ann. Discrete Math. 51, 161-166 (1992)","DOI":"10.1007\/BF02102124"},{"key":"45_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 297\u2013308. Springer, Heidelberg (2003)"},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/j.endm.2005.06.039","volume":"22","author":"F. Montgolfier De","year":"2005","unstructured":"De Montgolfier, F., Rao, M.: The bi-join decomposition. Electronic Notes in Discrete Mathematics\u00a022, 173\u2013177 (2005)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"45_CR11","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1002\/net.3230120407","volume":"12","author":"D. Rotem","year":"1982","unstructured":"Rotem, D., Urrutia, J.: Circular permutation graphs. Networks\u00a012, 429\u2013437 (1982)","journal-title":"Networks"},{"key":"45_CR12","unstructured":"Seidel, J.J.: Graphs and two-graphs. In: Proc. 5th. Southeastern Conf. on Combinatorics, Graph Theory, and Computing, Winnipeg, Canada (1974)"},{"key":"45_CR13","series-title":"Teorie combinatorie, Atti Conv. Lincei","first-page":"481","volume-title":"A survey of two-graphs","author":"J.J. Seidel","year":"1973","unstructured":"Seidel, J.J.: A survey of two-graphs. Teorie combinatorie, Atti Conv. Lincei, vol.\u00a017, pp. 481\u2013511. Academia Nazionale dei Lincei, Rome (1973)"},{"key":"#cr-split#-45_CR14.1","unstructured":"Seidel, J.J., Taylor, D.E.: Two-graphs, a second survey. Algebraic Methods in Graph Theory, Conf. Szeged, vol. II (1978)"},{"key":"#cr-split#-45_CR14.2","unstructured":"Colloq. Math. Janos Bolyai 25, 689-711 (1981)"},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<171::AID-NET1>3.0.CO;2-F","volume":"27","author":"R. Sritharan","year":"1996","unstructured":"Sritharan, R.: A linear time algorithm to recognize circular permutation graphs. Networks\u00a027, 171\u2013174 (1996)","journal-title":"Networks"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20877-5_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:22:57Z","timestamp":1558574577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20877-5_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642208768","9783642208775"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20877-5_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}