{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T10:18:19Z","timestamp":1767867499987,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540667315","type":"print"},{"value":"9783540467847","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46784-x_14","type":"book-chapter","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T08:02:55Z","timestamp":1175760175000},"page":"135-147","source":"Crossref","is-referenced-by-count":25,"title":["On the Clique\u2014Width of Perfect Graph Classes"],"prefix":"10.1007","author":[{"given":"Martin Charles","family":"Golumbic","sequence":"first","affiliation":[]},{"given":"Udi","family":"Rotics","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1002\/(SICI)1097-0037(199805)31:3<177::AID-NET4>3.0.CO;2-C","volume":"31","author":"A. Brandst\u00e4dt","year":"1998","unstructured":"A. Brandst\u00e4dt and F.F. Dragan. A linear-time algorithm for connected r-domination and steiner tree on distance-hereditary graphs. Networks, 31:177\u2013182, 1998. 136","journal-title":"Networks"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B. Courcelle","year":"1993","unstructured":"B. Courcelle, J. Engelfriet, and G. Rozenberg. Handle-rewriting hypergraph grammars. J. Comput. System Sci., 46:218\u2013270, 1993. 135, 138","journal-title":"J. Comput. System Sci."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"B. Courcelle, J.A. Makowsky, and U. Rotics. Linear time solvable optimization problems on certain structured graph families, extended abstract. Graph Theoretic Concepts in Computer Science, 24th International Workshop, WG\u201998, volume 1517 of Lecture Notes in Computer Science, pages 1\u201316. Springer Verlang, 1998. 136","DOI":"10.1007\/10692760_1"},{"key":"14_CR4","unstructured":"B. Courcelle, J.A. Makowsky, and U. Rotics. On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic. To appear in Disc. Appl. Math. 136"},{"key":"14_CR5","unstructured":"B. Courcelle and S. Olariu. Upper bounds to the clique-width of graphs. to appear in Disc. Appl. Math. ( http:\/\/dept-info.labri.u-bordeaux.fr\/?courcell\/ActSci.html ), 1998. 135, 137, 138"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1137\/0217032","volume":"17","author":"A. D\u2019Atri","year":"1988","unstructured":"A. D\u2019Atri and M. Moscarini. Distance-hereditary graphs Steiner trees and connected domination. SIAM J. Comput., 17:521\u2013538, 1988. 136","journal-title":"SIAM J. Comput."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"F.F. Dragan, F. Nicolai, and A. Brandst\u00e4dt. LexBFS-orderings and powers of graphs. Graph Theoretic Concepts in Computer Science, 22th International Workshop, WG\u201996, volume 1197 of Lecture Notes in Computer Science, pages 166\u2013180, 1997. 136","DOI":"10.1007\/3-540-62559-3_15"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"F.F. Dragan. Dominating cliques in distance-hereditary graphs. Algorithm theory-SWAT\u201994, volume 824 of Lecture Notes in Computer Science, pages 370\u2013381, 1994. 136","DOI":"10.1007\/3-540-58218-5_34"},{"key":"14_CR9","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M. C. Golumbic","year":"1980","unstructured":"M. C. Golumbic. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York, 1980. 137, 143"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0166-218X(90)90131-U","volume":"27","author":"P. L. Hammer","year":"1990","unstructured":"P. L. Hammer and F. Maffray. Completely separable graphs. Disc. Appl. Math., 27:85\u201399, 1990. 136, 139","journal-title":"Disc. Appl. Math."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/qmath\/28.4.417","volume":"28","author":"E. Howorka","year":"1977","unstructured":"E. Howorka. A characterization of distance-hereditary graphs. Q. J. Math. Oxford Ser. (2), 28:417\u2013420, 1977. 136","journal-title":"Q. J. Math. Oxford Ser. (2)"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"J.A. Makowsky and U. Rotics. On the classes of graphs with few P4\u2019s. To appear in the International Journal of Foundations of Computer Science (IJFCS), 1999. 137","DOI":"10.1142\/S0129054199000241"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"U. N. Peled and J. Wu. Restricted unimodular chordal graphs. To appear in Journal of Graph Theory, 1999. 136","DOI":"10.1002\/(SICI)1097-0118(199902)30:2<121::AID-JGT6>3.0.CO;2-1"}],"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\/3-540-46784-X_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T23:38:21Z","timestamp":1556321901000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46784-X_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540667315","9783540467847"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-46784-x_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1999]]}}}