{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:32:24Z","timestamp":1725564744968},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540204527"},{"type":"electronic","value":"9783540398905"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39890-5_31","type":"book-chapter","created":{"date-parts":[[2010,9,4]],"date-time":"2010-09-04T01:16:57Z","timestamp":1283563017000},"page":"358-369","source":"Crossref","is-referenced-by-count":1,"title":["Recognizing Bipolarizable and P 4-Simplicial Graphs"],"prefix":"10.1007","author":[{"given":"Stavros D.","family":"Nikolopoulos","sequence":"first","affiliation":[]},{"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","unstructured":"Berge, C.: F\u00e4rbung von Graphen deren s\u00e4mtliche bzw. deren ungerade Kreise starr (Zusammenfassung), Wissenschaftliche Zeitschrift, Martin Luther Universit\u00e4t Halle-Witterberg, Mathematisch-Naturwissenschaftliche Reihe, 114\u2013115 (1961)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.P.: Graph classes: A survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"31_CR3","unstructured":"Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R.: The strong perfect graph theorem (submitted)"},{"key":"31_CR4","first-page":"63","volume":"21","author":"V. Chv\u00e1tal","year":"1984","unstructured":"Chv\u00e1tal, V.: Perfectly ordered graphs. Annals of Discrete Math.\u00a021, 63\u201365 (1984)","journal-title":"Annals of Discrete Math."},{"key":"31_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.K.: A linear recognition algorithm for cographs. SIAM J. Comput.\u00a014, 926\u2013934 (1985)","journal-title":"SIAM J. Comput."},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1006\/jagm.2001.1185","volume":"41","author":"E. Dahlhaus","year":"2001","unstructured":"Dahlhaus, E., Gustedt, J., McConnell, R.M.: Efficient and practical algorithms for sequential modular decomposition. J. Algorithms\u00a041, 360\u2013387 (2001)","journal-title":"J. Algorithms"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/S0166-218X(02)00499-7","volume":"128","author":"E.M. Eschen","year":"2003","unstructured":"Eschen, E.M., Johnson, J.L., Spinrad, J.P., Sritharan, R.: Recognition of some perfectly orderable graph classes. Discrete Appl. Math.\u00a0128, 355\u2013373 (2003)","journal-title":"Discrete Appl. Math."},{"key":"31_CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, Inc., London (1980)"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/S0304-3975(97)00241-7","volume":"234","author":"M. Habib","year":"2000","unstructured":"Habib, M., McConnell, R.M., Paul, C., Viennot, L.: Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing. Theoret. Comput. Sci.\u00a0234, 59\u201384 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR10","first-page":"173","volume":"4","author":"M. Habib","year":"2001","unstructured":"Habib, M., Paul, C., Viennot, L.: Linear time recognition of P4-indifference graphs. Discrete Math. and Theor. Comput. Sci.\u00a04, 173\u2013178 (2001)","journal-title":"Discrete Math. and Theor. Comput. Sci."},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/BF02579333","volume":"1","author":"P.L. Hammer","year":"1981","unstructured":"Hammer, P.L., Simeone, B.: The splittance of a graph. Combinatorica\u00a01, 275\u2013284 (1981)","journal-title":"Combinatorica"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0012-365X(90)90176-I","volume":"81","author":"A. Hertz","year":"1990","unstructured":"Hertz, A.: Bipolarizable graphs. Discrete Math.\u00a081, 25\u201332 (1990)","journal-title":"Discrete Math."},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0166-218X(94)00162-7","volume":"66","author":"C.T. Ho\u00e0ng","year":"1996","unstructured":"Ho\u00e0ng, C.T.: On the complexity of recognizing a class of perfectly orderable graphs. Discrete Appl. Math.\u00a066, 219\u2013226 (1996)","journal-title":"Discrete Appl. Math."},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1002\/jgt.3190120310","volume":"12","author":"C.T. Ho\u00e0ng","year":"1988","unstructured":"Ho\u00e0ng, C.T., Khouzam, N.: On brittle graphs. J. Graph Theory\u00a012, 391\u2013404 (1988)","journal-title":"J. Graph Theory"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1002\/(SICI)1097-0118(199907)31:3<155::AID-JGT1>3.0.CO;2-R","volume":"31","author":"C.T. Ho\u00e0ng","year":"1999","unstructured":"Ho\u00e0ng, C.T., Maffray, F., Noy, M.: A characterization of P4-indifference graphs. J. Graph Theory\u00a031, 155\u2013162 (1999)","journal-title":"J. Graph Theory"},{"key":"31_CR16","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1002\/jgt.3190130407","volume":"13","author":"C.T. Ho\u00e0ng","year":"1989","unstructured":"Ho\u00e0ng, C.T., Reed, B.A.: Some classes of perfectly orderable graphs. J. Graph Theory\u00a013, 445\u2013463 (1989)","journal-title":"J. Graph Theory"},{"key":"31_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(89)90209-4","volume":"74","author":"C.T. Ho\u00e0ng","year":"1989","unstructured":"Ho\u00e0ng, C.T., Reed, B.A.: P4-comparability graphs. Discrete Math.\u00a074, 173\u2013200 (1989)","journal-title":"Discrete Math."},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/S0304-3975(00)00005-0","volume":"259","author":"C.T. Ho\u00e0ng","year":"2001","unstructured":"Ho\u00e0ng, C.T., Sritharan, R.: Finding houses and holes in graphs. Theoret. Comput. Sci.\u00a0259, 233\u2013244 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1137\/0221027","volume":"21","author":"B. Jamison","year":"1992","unstructured":"Jamison, B., Olariu, S.: A linear-time recognition algorithm for P4-sparse graphs. SIAM J. Comput.\u00a021, 381\u2013407 (1992)","journal-title":"SIAM J. Comput."},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/0304-3975(95)00016-P","volume":"145","author":"B. Jamison","year":"1995","unstructured":"Jamison, B., Olariu, S.: A linear-time algorithm to recognize P4-reducible graphs. Theoret. Comput. Sci.\u00a0145, 329\u2013344 (1995)","journal-title":"Theoret. Comput. Sci."},{"key":"31_CR21","unstructured":"McConnell, R.M., Spinrad, J.: Linear-time modular decomposition and efficient transitive orientation. In: Proc. 5th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 1994), pp. 536\u2013545 (1994)"},{"key":"31_CR22","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0012-365X(90)90251-C","volume":"80","author":"M. Middendorf","year":"1990","unstructured":"Middendorf, M., Pfeiffer, F.: On the complexity of recognizing perfectly orderable graphs. Discrete Math.\u00a080, 327\u2013333 (1990)","journal-title":"Discrete Math."},{"key":"31_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/3-540-36379-3_31","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S.D. Nikolopoulos","year":"2002","unstructured":"Nikolopoulos, S.D., Palios, L.: On the recognition of P 4-comparability graphs. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 355\u2013366. Springer, Heidelberg (2002)"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"Nikolopoulos, S.D., Palios, L.: Recognizing bipolarizable and P4-simplicial graphs, Technical Report 7-03, Dept of Computer Science, Univ. of Ioannina (2003)","DOI":"10.1007\/978-3-540-39890-5_31"},{"key":"31_CR25","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(89)90208-2","volume":"74","author":"S. Olariu","year":"1989","unstructured":"Olariu, S.: Weak bipolarizable graphs. Discrete Math.\u00a074, 159\u2013171 (1989)","journal-title":"Discrete Math."},{"key":"31_CR26","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1137\/0205021","volume":"5","author":"D.J. Rose","year":"1976","unstructured":"Rose, D.J., Tarjan, R.E., Lueker, G.S.: Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput.\u00a05, 266\u2013283 (1976)","journal-title":"SIAM J. Comput."},{"key":"31_CR27","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0166-218X(91)90030-Z","volume":"31","author":"A.A. Sch\u00e4ffer","year":"1991","unstructured":"Sch\u00e4ffer, A.A.: Recognizing brittle graphs: remarks on a paper of Ho\u00e0ng and Khouzam. Discrete Appl. Math.\u00a031, 29\u201335 (1991)","journal-title":"Discrete Appl. Math."}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T13:18:49Z","timestamp":1559567929000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39890-5_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540204527","9783540398905"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39890-5_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}