{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:49Z","timestamp":1759063489623},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1997,3,1]],"date-time":"1997-03-01T00:00:00Z","timestamp":857174400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5982,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1997,3]]},"DOI":"10.1016\/s0012-365x(96)00180-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:36:38Z","timestamp":1027618598000},"page":"321-342","source":"Crossref","is-referenced-by-count":3,"special_numbering":"C","title":["Scattering number and modular decomposition"],"prefix":"10.1016","volume":"165-166","author":[{"given":"V.","family":"Giakoumakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Roussel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"H.","family":"Thuillier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(96)00180-X_BIB1","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/moor.8.2.170","article-title":"A fast algorithm for the decomposition of graphs and posets","volume":"8","author":"Buer","year":"1983","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0012-365X(96)00180-X_BIB2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and hamiltonicity","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(96)00180-X_BIB3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Comeil","year":"1981","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00180-X_BIB4","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Comeil","year":"1985","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(96)00180-X_BIB5","first-page":"68","article-title":"A new linear algorithm for modular decomposition","volume":"Vol. 787","author":"Cournier","year":"1994"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB6","doi-asserted-by":"crossref","unstructured":"J-L. Fouquet and V. Giakoumakis, On semi-P4-sparse graphs, Discrete Math., to appear.","DOI":"10.1016\/S0012-365X(96)00177-X"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB7","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbar graphen","volume":"18","author":"Galla\u00ef","year":"1967","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/S0012-365X(96)00180-X_BIB8","series-title":"4th Twente Workshop on Graphs and Combinatorial Optimization","article-title":"On extended P4-sparse graphs, Extended abstract","author":"Giakoumakis","year":"1995"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB9","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB10","author":"Ho\u00e0ng","year":"1985"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB11","unstructured":"W. Hochst\u00e4ttler and G. Tinhofer, Hamiltonicity in graphs with few P4s, Rutcor Research Report 16-93; Computing, to appear."},{"key":"10.1016\/S0012-365X(96)00180-X_BIB12","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0166-218X(92)90036-A","article-title":"A tree representation for P4-sparse graphs","volume":"35","author":"Jamison","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0012-365X(96)00180-X_BIB13","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1137\/0221027","article-title":"Recognizing P4-sparse graphs in linear time","volume":"21","author":"Jamison","year":"1992","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0012-365X(96)00180-X_BIB14","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0095-8956(78)90013-8","article-title":"On a class of posets and the corresponding comparability graphs","volume":"24","author":"Jung","year":"1978","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB15","article-title":"Computing the toughness and the scattering number for interval and other graphs","author":"Kratsch","year":"1994","journal-title":"IRISA Report PI-806"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB16","series-title":"On cliques and kernels","author":"Lerchs","year":"1971"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB17","series-title":"On the cliques-kernel structure of graphs","author":"Lerchs","year":"1972"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB18","series-title":"Linear-time modular decomposition and efficient tranitive orientation of comparability graphs","author":"McConnel","year":"1993"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB19","series-title":"Graphs and Order","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"M\u00f6hring","year":"1985"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB20","first-page":"257","article-title":"Substitution decomposition and connections with combinatorial optimization","volume":"19","author":"M\u00f6hring","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0012-365X(96)00180-X_BIB21","article-title":"Scattering number and hamiltonicity of Jung semi-P4-sparse graphs","author":"Giakoumakis","year":"1996"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB22","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01210984","article-title":"Graph derivates","volume":"76","author":"Sabidussi","year":"1961","journal-title":"Math. Z."},{"key":"10.1016\/S0012-365X(96)00180-X_BIB23","series-title":"Proc. 2nd Czechoslov. Symp. on Graph Theory","first-page":"481","article-title":"Path partitions of vertices and hamiltonicity of graphs","author":"Skupie\u0144","year":"1975"},{"key":"10.1016\/S0012-365X(96)00180-X_BIB24","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0012-365X(73)90100-3","article-title":"Graphs indecomposable with respect to the X-join","volume":"6","author":"Sumner","year":"1973","journal-title":"Discrete Math."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600180X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9600180X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:27:18Z","timestamp":1556130438000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9600180X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,3]]},"references-count":24,"alternative-id":["S0012365X9600180X"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(96)00180-x","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1997,3]]}}}