{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T21:50:33Z","timestamp":1778795433986,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642175169","type":"print"},{"value":"9783642175176","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17517-6_19","type":"book-chapter","created":{"date-parts":[[2010,12,3]],"date-time":"2010-12-03T15:13:41Z","timestamp":1291389221000},"page":"194-205","source":"Crossref","is-referenced-by-count":6,"title":["Seidel Minor, Permutation Graphs and Combinatorial Properties"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Limouzy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jctb.1994.1008","volume":"60","author":"A. Bouchet","year":"1994","unstructured":"Bouchet, A.: Circle graph obstructions. Journal of Combinatorial Theory, Series B\u00a060(1), 107\u2013144 (1994)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-540-77120-3_7","volume-title":"Algorithms and Computation","author":"B.-M. Bui-Xuan","year":"2007","unstructured":"Bui-Xuan, B.-M., Habib, M., Limouzy, V., de Montgolfier, F.: Unifying two graph decompositions with modular decomposition. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 52\u201364. Springer, Heidelberg (2007)"},{"key":"19_CR3","unstructured":"Bui-Xuan, B.-M., Habib, M., Limouzy, V., de Montgolfier, F.: A new tractable combinatorial decomposition (2008) (submitted)"},{"issue":"3","key":"19_CR4","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 Applied Mathematics\u00a02(3), 181\u2013184 (1980)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"Corneil, D.G., Perl, Y., Stewart, L.: A linear recognition algorithm for cographs. SIAM Journal on Computing\u00a014(4), 926\u2013934 (1985)","journal-title":"SIAM Journal on Computing"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: Theory of 2-Structures: A Framework for Decomposition and Transformation of Graphs. World Scientific, Singapore (1999)","DOI":"10.1142\/4197"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1145\/321707.321710","volume":"19","author":"S. Even","year":"1972","unstructured":"Even, S., Pnueli, A., Lempel, A.: Permutation graphs and transitive graphs. Journal of ACM\u00a019(3), 400\u2013410 (1972)","journal-title":"Journal of ACM"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T. Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Mathematica Academiae Scientiarum Hungaricae\u00a018, 25\u201366 (1967)","journal-title":"Acta Mathematica Academiae Scientiarum Hungaricae"},{"key":"19_CR9","first-page":"314","volume-title":"Annals of Discrete Mathematics","author":"M.C. Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic graph theory and perfect graphs. In: Annals of Discrete Mathematics, 2nd edn., vol.\u00a057, p. 314. Elsevier, Amsterdam (2004)","edition":"2"},{"issue":"2","key":"19_CR10","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 P3-structure: A switching approach. Journal of Combinatorial Theory, Series B\u00a066(2), 247\u2013262 (1996)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1-3","key":"19_CR11","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 Applied Mathematics\u00a094(1-3), 3\u20137 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"19_CR12","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.L. (ed.) WG 2003. LNCS, vol.\u00a02880, pp. 297\u2013308. Springer, Heidelberg (2003)"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"271","DOI":"10.4064\/fm-15-1-271-283","volume":"15","author":"C. Kuratowski","year":"1930","unstructured":"Kuratowski, C.: Sur le probl\u00e8me des courbes gauches en topologie. Fundamenta Mathematicae\u00a015, 271\u2013283 (1930)","journal-title":"Fundamenta Mathematicae"},{"key":"19_CR14","unstructured":"Limouzy, V.: Seidel complementation, combinatorial properties (2009) (in preparation), http:\/\/arxiv.org\/abs\/0904.1923"},{"key":"19_CR15","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":"19_CR16","doi-asserted-by":"crossref","unstructured":"de Montgolfier, F., Rao, M.: Bipartitive families and the bi-join decomposition (submitted 2005), http:\/\/hal.archives-ouvertes.fr\/hal-00132862","DOI":"10.1016\/j.endm.2005.06.039"},{"issue":"1-3","key":"19_CR17","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0012-365X(98)00319-7","volume":"201","author":"R.M. McConnell","year":"1999","unstructured":"McConnell, R.M., Spinrad, J.P.: Modular decomposition and transitive orientation. Discrete Mathematics\u00a0201(1-3), 189\u2013241 (1999)","journal-title":"Discrete Mathematics"},{"key":"19_CR18","unstructured":"Oum, S.-I.: Graphs Of Bounded Rank Width. PhD thesis. Princeton University (2005)"},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.jctb.2005.03.003","volume":"95","author":"S.-I. Oum","year":"2005","unstructured":"Oum, S.-I.: Rank-width and vertex-minors. Journal of Combinatorial Theory, Series B\u00a095(1), 79\u2013100 (2005)","journal-title":"Journal of Combinatorial Theory, Series B"},{"issue":"1","key":"19_CR20","doi-asserted-by":"publisher","first-page":"160","DOI":"10.4153\/CJM-1971-016-5","volume":"23","author":"A. Pnueli","year":"1971","unstructured":"Pnueli, A., Lempel, A., Even, S.: Transitive orientation of graphs and identification of permutation graphs. Canadian Journal of Mathematics\u00a023(1), 160\u2013175 (1971)","journal-title":"Canadian Journal of Mathematics"},{"key":"19_CR21","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":"19_CR22","series-title":"Atti dei Convegni Lincei","first-page":"481","volume-title":"Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo I","author":"J.J. Seidel","year":"1976","unstructured":"Seidel, J.J.: A survey of two-graphs. In: Colloquio Internazionale sulle Teorie Combinatorie (Rome, 1973), Tomo I. Atti dei Convegni Lincei, vol.\u00a017, pp. 481\u2013511. Accad. Naz. Lincei, Rome (1976)"},{"issue":"3","key":"19_CR23","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(3), 171\u2013174 (1996)","journal-title":"Networks"},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1007\/978-3-540-70575-8_52","volume-title":"Automata, Languages and Programming","author":"M. Tedder","year":"2008","unstructured":"Tedder, M., Corneil, D.G., Habib, M., Paul, C.: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 634\u2013645. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17517-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T15:49:28Z","timestamp":1559836168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17517-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642175169","9783642175176"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17517-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}