{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T11:00:01Z","timestamp":1768734001533,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540204527","type":"print"},{"value":"9783540398905","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_26","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T21:16:57Z","timestamp":1283548617000},"page":"297-308","source":"Crossref","is-referenced-by-count":12,"title":["Complexity of Hypergraph Coloring and Seidel\u2019s Switching"],"prefix":"10.1007","author":[{"given":"Jan","family":"Kratochv\u00edl","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0166-218X(80)90038-4","volume":"2","author":"C.J. Colbourn","year":"1980","unstructured":"Colbourn, C.J., Corneil, D.G.: On deciding switching equivalence of graphs. Discrete Appl. Math.\u00a02, 181\u2013184 (1980)","journal-title":"Discrete Appl. Math."},{"key":"26_CR2","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.: Rozenberg: Pancyclicity in switching classes. Inform. Process. Letters\u00a073, 153\u2013156 (2000)","journal-title":"Inform. Process. Letters"},{"key":"26_CR3","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":"26_CR4","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzales","year":"1985","unstructured":"Gonzales, T.F.: Clustering to minimize the maximum intercluster distance. Theoret. Comput. Sci.\u00a038, 293\u2013306 (1985)","journal-title":"Theoret. Comput. Sci."},{"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","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0166-218X(98)00134-6","volume":"89","author":"A. Hertz","year":"1998","unstructured":"Hertz, A.: On perfect switching classes. Discr. Appl. Math.\u00a089, 263\u2013267 (1998)","journal-title":"Discr. Appl. Math."},{"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. Discr. Appl. Math.\u00a094, 3\u20137 (1999)","journal-title":"Discr. Appl. Math."},{"key":"26_CR9","first-page":"755","volume":"30","author":"J. Kratochvil","year":"1989","unstructured":"Kratochvil, J.: Perfect codes and two-graphs. Comment. Math. Univ. Carolin.\u00a030, 755\u2013760 (1989)","journal-title":"Comment. Math. Univ. Carolin."},{"key":"26_CR10","doi-asserted-by":"crossref","unstructured":"Kratochv\u00edl, J., Ne\u0161et\u0159il, J., Z\u00fdka, O.: On the computational complexity of Seidel\u2019s switching, Combinatorics, graphs and complexity. 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_CR11","unstructured":"Kratochvil, J., Rosenfeld, M.: unpublished"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. of the Tenth Annual ACM Symposium on Theory of Computing (STOC), pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"26_CR13","first-page":"481","volume":"17","author":"J.J. Seidel","year":"1973","unstructured":"Seidel, J.J.: A survey of two-graphs, Teorie combinatorie. Atti Conv. Lincei, Academia Nazionale dei Lincei, Rome\u00a017, 481\u2013511 (1973)","journal-title":"Atti Conv. Lincei, Academia Nazionale dei Lincei, Rome"},{"key":"26_CR14","first-page":"689","volume":"25","author":"J.J. Seidel","year":"1981","unstructured":"Seidel, J.J., Taylor, D.E.: Two-graphs, a second survey, Algebraic methods in graph theory, Vol. II, Conf. Szeged 1978. Colloq. Math. Janos Bolyai\u00a025, 689\u2013711 (1981)","journal-title":"Colloq. Math. Janos Bolyai"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Seidel, J.J.: More about two-graphs, Combinatorics, graphs and complexity. In: Proc. 4th Czech. Symp., Prachatice 1990. Ann. Discrete Math., vol.\u00a051, pp. 297\u2013308 (1992)","DOI":"10.1016\/S0167-5060(08)70646-0"}],"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_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T09:19:28Z","timestamp":1559553568000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}