{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:44:47Z","timestamp":1725551087511},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540003311"},{"type":"electronic","value":"9783540363798"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36379-3_6","type":"book-chapter","created":{"date-parts":[[2010,3,29]],"date-time":"2010-03-29T21:12:05Z","timestamp":1269897125000},"page":"57-67","source":"Crossref","is-referenced-by-count":13,"title":["New Graph Classes of Bounded Clique-Width"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Brandst\u00e4dt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feodor F.","family":"Dragan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ho\u00e0ng-Oanh","family":"Le","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raffaele","family":"Mosca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,2,28]]},"reference":[{"key":"6_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":"H.-J. Bandelt, H.M. Mulder, Distance-hereditary graphs, J. Combin. Theory (B) 41 (1986) 182\u2013208","journal-title":"J. Combin. Theory (B)"},{"key":"6_CR2","unstructured":"A. Brandst\u00e4dt, (P5,diamond)-Free Graphs Revisited: Structure, Bounded cliquewidth and Linear Time Optimization, Manuscript 2000; accepted for Discrete Applied Math."},{"key":"6_CR3","unstructured":"A. Brandst\u00e4dt, C.T. Ho\u00e0ng, V.B. Le, Stability Number of Bull-and Chair-Free Graphs Revisited, Manuscript 2001; accepted for Discrete Applied Math."},{"key":"6_CR4","unstructured":"A. Brandst\u00e4dt, D. Kratsch, On the structure of (P5,gem)-free graphs, Manuscript 2001"},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, H.-O. Le, R. Mosca, Chordal co-gem-free graphs have bounded clique-width, Manuscript 2002","DOI":"10.1007\/3-540-36379-3_6"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"A. Brandst\u00e4dt, H.-O. Le, R. Mosca, (Gem,co-gem)-free graphs have bounded clique-width, Manuscript 2002","DOI":"10.1007\/3-540-36379-3_6"},{"key":"6_CR7","volume-title":"SIAM Monographs on Discrete Math. Appl.","author":"A. Brandst\u00e4dt","year":"1999","unstructured":"A. Brandst\u00e4dt, V.B. Le, J. Spinrad, Graph Classes: A Survey, SIAM Monographs on Discrete Math. Appl., Vol. 3, SIAM, Philadelphia (1999)"},{"key":"6_CR8","unstructured":"A. Brandst\u00e4dt, H.-O. Le, J.-M. Vanherpe, Structure and Stability Number of (Chair, Co-P, Gem)-Free Graphs, Manuscript 2001"},{"key":"6_CR9","unstructured":"A. Brandst\u00e4dt, S. Mahfud, Linear time for Maximum Weight Stable Set on (claw,co-claw)-free graphs and similar graph classes, Manuscript 2001; to appear in Information Processing Letters"},{"key":"6_CR10","unstructured":"A. Brandst\u00e4dt, R. Mosca, On the Structure and Stability Number of P5-and Co-Chair-Free Graphs, Manuscript 2001; accepted for Discrete Applied Math."},{"key":"6_CR11","unstructured":"A. Brandst\u00e4dt, R. Mosca, On Variations of P4-Sparse Graphs, Manuscript 2001"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","volume":"3","author":"D.G. Corneil","year":"1981","unstructured":"D.G. Corneil, H. Lerchs, L. Stewart-Burlingham, Complement reducible graphs, Discrete Applied Math. 3 (1981) 163\u2013174","journal-title":"Discrete Applied Math."},{"key":"6_CR13","first-page":"249","volume":"43","author":"D.G. Corneil","year":"1984","unstructured":"D.G. Corneil, Y. Perl, L.K. Stewart, Cographs: recognition, applications, and algorithms, Congressus Numer. 43 (1984) 249\u2013258","journal-title":"Congressus Numer."},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"926","DOI":"10.1137\/0214065","volume":"14","author":"D.G. Corneil","year":"1985","unstructured":"D.G. Corneil, Y. Perl, L.K. Stewart, A linear recognition algorithm for cographs, SIAM J. Computing 14 (1985) 926\u2013934","journal-title":"SIAM J. Computing"},{"key":"6_CR15","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, G. Rozenberg, Handle-rewriting hypergraph grammars, J. Comput. Syst. Sciences, 46 (1993) 218\u2013270","journal-title":"J. Comput. Syst. Sciences"},{"key":"6_CR16","series-title":"Lect Notes Comput Sci","first-page":"1","volume-title":"Theory of Computing Systems","author":"B. Courcelle","year":"1998","unstructured":"B. Courcelle, J.A. Makowsky, U. Rotics, Linear time solvable optimization problems on graphs of bounded clique width, extended abstract in: Conf. Proc. WG\u201998, LNCS 1517 (1998) 1\u201316; Theory of Computing Systems 33 (2000) 125-150"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/S0166-218X(99)00184-5","volume":"101","author":"B. Courcelle","year":"2000","unstructured":"B. Courcelle, S. Olariu, Upper bounds to the clique-width of graphs, Discrete Appl. Math. 101 (2000) 77\u2013114","journal-title":"Discrete Appl. Math."},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/BF01195324","volume":"9","author":"C. Simone De","year":"1993","unstructured":"C. De Simone, On the vertex packing problem, Graphs and Combinatorics 9 (1993) 19\u201330","journal-title":"Graphs and Combinatorics"},{"key":"6_CR19","first-page":"311","volume":"19","author":"S. F\u00f6ldes","year":"1977","unstructured":"S. F\u00f6ldes, P.L. Hammer, Split graphs, Congress. Numer. 19 (1977), 311\u2013315","journal-title":"Congress. Numer."},{"key":"6_CR20","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0012-365X(93)90539-6","volume":"121","author":"J.-L. Fouquet","year":"1993","unstructured":"J.-L. Fouquet, A decomposition for a class of (P5, P5)-free graphs, Discrete Math. 121 (1993) 75\u201383","journal-title":"Discrete Math."},{"key":"6_CR21","first-page":"267","volume":"165\u2013166","author":"J.-L. Fouquet","year":"1997","unstructured":"J.-L. Fouquet, V. Giakoumakis On semi-P4-sparse graphs, Discrete Math. 165\u2013166 (1997) 267\u2013290","journal-title":"Discrete Math."},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/0012-365X(94)00155-X","volume":"146","author":"J.-L. Fouquet","year":"1995","unstructured":"J.-L. Fouquet, V. Giakoumakis, H. Thuillier, F. Maire, On graphs without P5 and P5, Discrete Math. 146 (1995) 33\u201344","journal-title":"Discrete Math."},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1142\/S0129054100000260","volume":"11","author":"M.C. Golumbic","year":"2000","unstructured":"M.C. Golumbic, U. Rotics, On the clique-width of some perfect graph classes, Int. Journal of Foundations of Computer Science 11 (2000) 423\u2013443","journal-title":"Int. Journal of Foundations of Computer Science"},{"key":"6_CR24","unstructured":"A. Hertz, On a graph transformation which preserves the stability number, Yugoslav Journal of Oper. Res., to appear"},{"key":"6_CR25","volume-title":"A Class of Perfect Graphs, Ms. Sc. Thesis","author":"C.T. Ho\u00e0ng","year":"1983","unstructured":"C.T. Ho\u00e0ng, A Class of Perfect Graphs, Ms. Sc. Thesis, School of Computer Science, McGill University, Montreal (1983)"},{"key":"6_CR26","volume-title":"Perfect Graphs, Ph. D. Thesis","author":"C.T. Ho\u00e0ng","year":"1985","unstructured":"C.T. Ho\u00e0ng, Perfect Graphs, Ph. D. Thesis, School of Computer Science, McGill University, Montreal (1985)"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1002\/jgt.3190130407","volume":"13","author":"C.T. Ho\u00e0ng","year":"1989","unstructured":"C.T. Ho\u00e0ng, B. Reed, Some classes of perfectly orderable graphs, J. Graph Theory 13 (1989) 445\u2013463","journal-title":"J. Graph Theory"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","volume":"35","author":"B. Jamison","year":"1992","unstructured":"B. Jamison, S. Olariu, A unique tree representation for P4-sparse graphs, Discrete Appl. Math. 35 (1992), 115\u2013129","journal-title":"Discrete Appl. Math."},{"key":"6_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0012-365X(99)00408-2","volume":"222","author":"V.V. Lozin","year":"2000","unstructured":"V.V. Lozin, Conic reduction of graphs for the stable set problem, Discrete Math. 222 (2000) 199\u2013211","journal-title":"Discrete Math."},{"key":"6_CR30","unstructured":"N.V.R. Mahadev, U.N. Peled, Threshold Graphs and Related Topics, Annals of Discrete Mathematics 56 (1995)"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1142\/S0129054199000241","volume":"3","author":"J.A. Makowsky","year":"1999","unstructured":"J.A. Makowsky, U. Rotics, On the clique-width of graphs with few P4\u2019s, Int. J. of Foundations of Computer Science 3 (1999) 329\u2013348","journal-title":"Int. J. of Foundations of Computer Science"},{"key":"6_CR32","first-page":"257","volume":"19","author":"R.H. M\u00f6hring","year":"1984","unstructured":"R.H. M\u00f6hring, F.J. Radermacher, Substitution decomposition for discrete structures and connections with combinatorial optimization, Annals of Discrete Math. 19 (1984) 257\u2013356","journal-title":"Annals of Discrete Math."},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/0603036","volume":"3","author":"M. Yannakakis","year":"1982","unstructured":"M. Yannakakis, The complexity of the partial order dimension problem, SIAM J. Algebraic and Discrete Methods 3 (1982) 351\u2013358","journal-title":"SIAM J. Algebraic and Discrete Methods"},{"key":"6_CR34","unstructured":"I.E. Zverovich, I.I. Zverovich, Extended (P5,P5)-free graphs, Rutcor Research Report RRR 22-2001 (2001) http:\/\/rutcor.rutgers.edu\/~rrr"}],"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-36379-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T18:48:14Z","timestamp":1558982894000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36379-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540003311","9783540363798"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/3-540-36379-3_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}