{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:50:57Z","timestamp":1725490257931},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540443100"},{"type":"electronic","value":"9783540458326"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45832-8_13","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:13:34Z","timestamp":1188314014000},"page":"148-160","source":"Crossref","is-referenced-by-count":4,"title":["Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes"],"prefix":"10.1007","author":[{"given":"Jurriaan","family":"Hage","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tero","family":"Harju","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emo","family":"Welzl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"issue":"3","key":"13_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","volume":"8","author":"B. Aspvall","year":"1979","unstructured":"B. Aspvall, M.F. Plass, and R.E. Tarjan. A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Proc. Letters, 8(3):121\u2013123, 1979.","journal-title":"Inf. Proc. Letters"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF01215145","volume":"157","author":"P.J. Cameron","year":"1977","unstructured":"P.J. Cameron. Cohomological aspects of two-graphs. Math. Z., 157:101\u2013119, 1977.","journal-title":"Math. Z."},{"volume-title":"Geometry and Combinatorics: Selected Works of J.J. Seidel","year":"1991","key":"13_CR3","unstructured":"D.G. Corneil and R.A. Mathon, editors. Geometry and Combinatorics: Selected Works of J.J. Seidel. Academic Press, Boston, 1991."},{"key":"13_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/978-3-540-46464-8_5","volume-title":"Theory And Application Of Graph Transformations-TAGT\u2019 98","author":"A. Ehrenfeucht","year":"2000","unstructured":"A. Ehrenfeucht, J. Hage, T. Harju, and G. Rozenberg. Complexity issues in switching of graphs. In H. Ehrig, G. Engels, H.-J. Kreowski, and G. Rozenberg, editors, Theory And Application Of Graph Transformations-TAGT\u2019 98, volume 1764 of Lecture Notes in Computer Science, pages 59\u201370, Berlin, 2000. Springer-Verlag."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"A. Ehrenfeucht, T. Harju, and G. Rozenberg. The Theory of 2-Structures. World Scientific, 1999.","DOI":"10.1142\/4197"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1017\/S0960129500000554","volume":"4","author":"A. Ehrenfeucht","year":"1994","unstructured":"A. Ehrenfeucht and G. Rozenberg. Dynamic labeled 2-structures. Mathematical Structures in Computer Science, 4:433\u2013455, 1994.","journal-title":"Mathematical Structures in Computer Science"},{"key":"13_CR7","volume-title":"Topological Graph Theory","author":"J.L. Gross","year":"1987","unstructured":"J.L. Gross and T.W. Tucker. Topological Graph Theory. Wiley, New York, 1987."},{"key":"13_CR8","unstructured":"J. Hage. Structural Aspects Of Switching Classes. PhD thesis, LIACS, 2001. \n                    http:\/\/www.cs.uu.nl\/people\/jur\/2s.html\n                    \n                  ."},{"key":"13_CR9","unstructured":"J. Hage and T. Harju. A characterization of acyclic switching classes using forbidden subgraphs. Technical Report 5, Leiden University, Department of Computer Science, 2000. Submitted to Siam J. Disc. Math."},{"key":"13_CR10","unstructured":"J. Kratochv\u00fdl, J. Ne\u0161et\u0159il, and O. Z\u00fdka. On the computational complexity of Seidel\u2019s switching, in: Combinatorics, Graphs and Complexity (M. Fiedler and J. Ne\u0161et\u0159il eds.) Proceedings 4th Czechoslovak Symposium on Combinatorics, Prachatice 1990. Annals of Discrete Math., 51:161\u2013166, 1992."},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1137\/0128070","volume":"28","author":"C.L. Mallows","year":"1975","unstructured":"C.L. Mallows and N.J.A. Sloane. Two-graphs, switching classes and Euler graphs are equal in number. SIAM J. Appl. Math, 28:876\u2013880, 1975.","journal-title":"SIAM J. Appl. Math"},{"key":"13_CR12","unstructured":"J.J. Seidel. Graphs and two-graphs. In Proc. 5th Southeastern Conf. on Combinatorics, Graph Theory, amd Computing, Winnipeg, Canada, 1974. Utilitas Mathematica Publishing Inc."},{"key":"13_CR13","first-page":"481","volume":"I","author":"J.J. Seidel","year":"1976","unstructured":"J.J. Seidel. A survey of two-graphs. In Colloquio Internazionale sulle Teorie Combinatorie (Rome,1973), volume I, pages 481\u2013511, Rome, 1976. Acc. Naz. Lincei. Reprinted in [3].","journal-title":"Colloquio Internazionale sulle Teorie Combinatorie (Rome,1973)"},{"key":"13_CR14","unstructured":"J.J. Seidel and D.E. Taylor. Two-graphs, a second survey. In L. Lovasz and V.T. S\u00f3s, editors, Algebraic Methods in Graph Theory (Proc. Internat. Colloq., Szeged, 1978), volume II, pages 689\u2013711, Amsterdam, 1981. North-Holland. Reprinted in [3]."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/0095-8956(89)90063-4","volume":"47","author":"T. Zaslavsky","year":"1989","unstructured":"T. Zaslavsky. Biased graphs. I. Bias, balance, and gains. J. Combin. Theory, Ser. B, 47:32\u201352, 1989.","journal-title":"J. Combin. Theory, Ser. B"}],"container-title":["Lecture Notes in Computer Science","Graph Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45832-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T04:47:29Z","timestamp":1550897249000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45832-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540443100","9783540458326"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45832-8_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}