{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:02:43Z","timestamp":1725552163015},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310006"},{"type":"electronic","value":"9783540314684"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11604686_40","type":"book-chapter","created":{"date-parts":[[2005,12,5]],"date-time":"2005-12-05T15:02:01Z","timestamp":1133794921000},"page":"456-467","source":"Crossref","is-referenced-by-count":2,"title":["Recognizing HHDS-Free Graphs"],"prefix":"10.1007","author":[{"given":"Stavros D.","family":"Nikolopoulos","sequence":"first","affiliation":[]},{"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"40_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0095-8956(86)90043-2","volume":"41","author":"H.-J. Bandelt","year":"1986","unstructured":"Bandelt, H.-J., Mulder, H.M.: Distance-hereditary graphs. J. Combin. Theory B\u00a041, 182\u2013208 (1986)","journal-title":"J. Combin. Theory B"},{"key":"40_CR2","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/S0304-3975(96)00091-6","volume":"172","author":"A. Brandst\u00e4dt","year":"1997","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Nicolai, F.: Homogeneously orderable graphs. Theoret. Comput. Sci.\u00a0172, 209\u2013232 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"40_CR3","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":"40_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":"40_CR5","unstructured":"Chv\u00e1tal, V.: A class of perfectly orderable graphs, Report 89573-OR, Forschungsinstitut f\u00fcr Diskrete Mathematik, Bonn (1989)"},{"key":"40_CR6","unstructured":"Chang, G.J.: k-Domination and Graph Covering Problems, Ph.D Thesis, School of OR and IE, Cornell University, Ithaca, NY (1982)"},{"key":"40_CR7","doi-asserted-by":"crossref","unstructured":"D\u2019Atri, A., Moscarini, M., Sassano, A.: The Steiner tree problem and homogeneous sets. Lecture Notes in Comput. Sci. 324, 249\u2013261 (1988)","DOI":"10.1007\/BFb0017148"},{"key":"40_CR8","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M. Farber","year":"1983","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discrete Math.\u00a043, 173\u2013189 (1983)","journal-title":"Discrete Math."},{"key":"40_CR9","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":"40_CR10","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":"40_CR11","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.\u00a0Graph Theory\u00a012, 391\u2013404 (1988)","journal-title":"J.\u00a0Graph Theory"},{"key":"40_CR12","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":"40_CR13","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":"40_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-540-30559-0_9","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S.D. Nikolopoulos","year":"2004","unstructured":"Nikolopoulos, S.D., Palios, L.: Recognizing HHD-free and Welsh-Powell opposition graphs. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 105\u2013116. Springer, Heidelberg (2004)"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"Nikolopoulos, S.D., Palios, L.: Recognizing HHD-free and Welsh-Powell opposition graphs, Technical Report TR-16-04, Dept.\u00a0of Computer Science, University of Ioannina (2004)","DOI":"10.1007\/978-3-540-30559-0_9"},{"key":"40_CR16","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.\u00a0Combin. Theory Ser.\u00a0B\u00a045, 150\u2013159 (1988)","journal-title":"J.\u00a0Combin. Theory Ser.\u00a0B"},{"key":"40_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."}],"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\/11604686_40.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:30Z","timestamp":1619507070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11604686_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540310006","9783540314684"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11604686_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}