{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T21:05:18Z","timestamp":1770325518110,"version":"3.49.0"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1016\/s0020-0190(96)00134-2","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T21:13:10Z","timestamp":1051132390000},"page":"29-36","source":"Crossref","is-referenced-by-count":20,"title":["P4-laden graphs: A new class of brittle graphs"],"prefix":"10.1016","volume":"60","author":[{"given":"Vassilis","family":"Giakoumakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(96)00134-2_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1979"},{"key":"10.1016\/S0020-0190(96)00134-2_BIB2","series-title":"Topics on Perfect Graphs","first-page":"63","article-title":"Perfectly ordered graphs","author":"Chv\u00e1tal","year":"1984"},{"issue":"4","key":"10.1016\/S0020-0190(96)00134-2_BIB3","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1002\/jgt.3190110405","article-title":"Four classes of perfectly orderable graphs","volume":"11","author":"Chv\u00e1tal","year":"1987","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(96)00134-2_BIB4","series-title":"Perfect graph seminar","author":"Chv\u00e1tal","year":"1983"},{"key":"10.1016\/S0020-0190(96)00134-2_BIB5","first-page":"68","article-title":"A new linear algorithm for modular decomposition","volume":"787","author":"Cournier","year":"1994"},{"key":"10.1016\/S0020-0190(96)00134-2_BIB6","series-title":"Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory and Computing","first-page":"311","article-title":"Split graphs","author":"F\u00f6lder","year":"1977"},{"key":"10.1016\/S0020-0190(96)00134-2_BIB7","series-title":"extended abstract for the 4th Twente Workshop on Graphs and Combinatorial Optimization","article-title":"On extended P4-sparse graphs","author":"Giakoumakis","year":"1995"},{"key":"10.1016\/S0020-0190(96)00134-2_BIB8","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbar Graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/S0020-0190(96)00134-2_BIB9","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02579333","article-title":"The splittance of a graph","volume":"1","author":"Hammer","year":"1981","journal-title":"Combinatorica"},{"issue":"3","key":"10.1016\/S0020-0190(96)00134-2_BIB10","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/jgt.3190120310","article-title":"On brittle graphs","volume":"12","author":"Ho\u00e0ng","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(96)00134-2_BIB11","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1002\/jgt.3190130407","article-title":"Some classes of perfectly orderable graphs","volume":"13","author":"Ho\u00e0ng","year":"1989","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0020-0190(96)00134-2_BIB12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1002\/sapm198981189","article-title":"A new class of brittle graphs","volume":"81","author":"Jamison","year":"1989","journal-title":"Stud. Appl. Math."},{"key":"10.1016\/S0020-0190(96)00134-2_BIB13","series-title":"linear-time modular decomposition and efficient transitive orientation of comparability graphs","author":"McConnel","year":"1993"},{"key":"10.1016\/S0020-0190(96)00134-2_BIB14","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0012-365X(90)90251-C","article-title":"On the complexity of recognizing perfectly orderable graphs","volume":"80","author":"Middendorf","year":"1990","journal-title":"Discrete Math."},{"key":"10.1016\/S0020-0190(96)00134-2_BIB15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0166-218X(91)90030-Z","article-title":"Recognizing brittle graphs: Remarks on a paper of Ho\u00e0ng and Kouzam","volume":"31","author":"Sch\u00e4ffer","year":"1991","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(96)00134-2_BIB16","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0166-218X(92)90180-I","article-title":"P4-trees and substitution decomposition","volume":"39","author":"Spinrad","year":"1992","journal-title":"Discrete Appl. Math."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001342?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001342?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:24:34Z","timestamp":1556058274000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019096001342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["S0020019096001342"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(96)00134-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}