{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:02:39Z","timestamp":1725483759382},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_48","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"528-538","source":"Crossref","is-referenced-by-count":4,"title":["On a Generalization of Bi-Complement Reducible Graphs"],"prefix":"10.1007","author":[{"given":"Vadim V.","family":"Lozin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"48_CR1","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 and L.K. Stewart, Complement reducible graphs, Discrete Appl. Math. 3 (1981) 163\u2013174.","journal-title":"Discrete Appl. Math"},{"key":"48_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 hypergraphs grammars, J. Comput. System Sci. 46 (1993) 218\u2013270.","journal-title":"J. Comput. System Sci"},{"key":"48_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"B. Courcelle, J.A. Makowsky and U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Systems 33 (2000) 125\u2013150.","journal-title":"Theory Comput. Systems"},{"key":"48_CR4","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. Thuiller and F. Maire, On graphs without P5 and P5, Discrete Math. 146 (1995) 33\u201344.","journal-title":"Discrete Math"},{"key":"48_CR5","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/S0012-365X(96)00177-X","volume":"165\/166","author":"J.-L. Fouquet","year":"1997","unstructured":"J-L. Fouquet and V. Giakoumakis, On semi-P4-sparse graphs, Discrete Math. 165\/166 (1997) 277\u2013230.","journal-title":"Discrete Math"},{"key":"48_CR6","unstructured":"M.G. Garey and D.S. Johnson, Computers and Intractability: A guide to the theory of NP-completeness, Mathematical series, W.H. Freeman and Company, (1979)."},{"key":"48_CR7","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1006\/aama.1996.0519","volume":"18","author":"V. Giakoumakis","year":"1997","unstructured":"V. Giakoumakis and J.-M. Vanherpe, Bi-complement reducible graphs, Advances in Appl. Math. 18 (1997) 389\u2013402.","journal-title":"Advances in Appl. Math"},{"key":"48_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/sapm198981179","volume":"81","author":"R. Jamison","year":"1989","unstructured":"R. Jamison and S. Olariu, P4-reducible graphs-a class of uniquely representable graphs, Studies in Appl. Math. 81 (1989) 79\u201387.","journal-title":"Studies in Appl. Math."},{"key":"48_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","volume":"35","author":"R. Jamison","year":"1992","unstructured":"R. Jamison and S. Olariu, A unique tree representation for P4-sparse graphs, Discrete Appl. Math. 35 (1992) 115\u2013129.","journal-title":"Discrete Appl. Math"},{"key":"48_CR10","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0166-218X(88)90100-X","volume":"22","author":"G. Tinhofer","year":"1988","unstructured":"G. Tinhofer, Strong tree-cographs are Birkhoff graphs, Discrete Appl. Math. 22 (1988\/89) 275\u2013288.","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T14:47:36Z","timestamp":1550328456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_48","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}