{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:23Z","timestamp":1725558983050},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_9","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T15:01:42Z","timestamp":1278082902000},"page":"105-116","source":"Crossref","is-referenced-by-count":2,"title":["Recognizing HHD-free and Welsh-Powell Opposition Graphs"],"prefix":"10.1007","author":[{"given":"Stavros D.","family":"Nikolopoulos","sequence":"first","affiliation":[]},{"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Brandstadt, A., Le, V.B., Spinrad, J.P.: Spinrad, Graph classes: A survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"key":"9_CR2","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":"9_CR3","volume-title":"Introduction to Algorithms (2nd edition)","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Inc., Cambridge (2001)"},{"key":"9_CR4","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":"9_CR5","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":"9_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0166-218X(96)00008-X","volume":"73","author":"R. Hayward","year":"1997","unstructured":"Hayward, R.: Meyniel weakly triangulated graphs I: co-perfect orderability. Discrete Appl. Math.\u00a073, 199\u2013210 (1997)","journal-title":"Discrete Appl. Math."},{"key":"9_CR7","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":"9_CR8","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":"9_CR9","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":"9_CR10","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1016\/0196-8858(88)90019-X","volume":"9","author":"B. Jamison","year":"1988","unstructured":"Jamison, B., Olariu, S.: On the semi-perfect elimination. Adv. Appl. Math.\u00a09, 364\u2013376 (1988)","journal-title":"Adv. Appl. Math."},{"key":"9_CR11","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":"9_CR12","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":"9_CR13","doi-asserted-by":"crossref","unstructured":"Nikolopoulos, S.D., Palios, L.: Recognizing HHD-free and Welsh-Powell opposition graphs, Technical Report TR-16-04, Dept. of Computer Science, University of Ioannina (2004)","DOI":"10.1007\/978-3-540-30559-0_9"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0095-8956(88)90066-4","volume":"45","author":"S. Olariu","year":"1988","unstructured":"Olariu, S.: All variations on perfectly orderable graphs. J. Combin. Theory Ser. B\u00a045, 150\u2013159 (1988)","journal-title":"J. Combin. Theory Ser. B"},{"key":"9_CR15","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":"9_CR16","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0020-0190(89)90107-5","volume":"31","author":"S. Olariu","year":"1989","unstructured":"Olariu, S., Randall, J.: Welsh-Powell opposition graphs. Inform. Process. Lett.\u00a031, 43\u201346 (1989)","journal-title":"Inform. Process. Lett."},{"key":"9_CR17","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":"9_CR18","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D.J.A. Welsh","year":"1967","unstructured":"Welsh, D.J.A., Powell, M.B.: An upper bound on the chromatic number of a graph and its applications to timetabling problems. Comput. J.\u00a010, 85\u201387 (1967)","journal-title":"Comput. J."}],"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-30559-0_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:22:22Z","timestamp":1605741742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}