{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:35:02Z","timestamp":1787340902818,"version":"build-2736575974"},"reference-count":10,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1992,4]]},"abstract":"<jats:p>A graph G is $P_4 $-sparse if no set of five vertices in G induces more than one chordless path of length three. $P_4 $-sparse graphs generalize both the class of cographs and the class of $P_4 $-reducible graphs. One remarkable feature of $P_4 $-sparse graphs is that they admit a tree representation unique up to isomorphism. It has been shown that this tree representation can be obtained in polynomial time. This paper gives a linear time algorithm to recognize $P_4 $-sparse graphs and shows how the data structures returned by the recognition algorithm can be used to construct the corresponding tree representation in linear time.<\/jats:p>","DOI":"10.1137\/0221027","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:38:23Z","timestamp":1109227103000},"page":"381-406","source":"Crossref","is-referenced-by-count":59,"title":["Recognizing $P_4 $-Sparse Graphs in Linear Time"],"prefix":"10.1137","volume":"21","author":[{"given":"Beverly","family":"Jamison","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephan","family":"Olariu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-349-03521-2"},{"key":"R2","first-page":"237","volume":"39","author":"Corneil D. G.","year":"1983","journal-title":"Congr. Numer."},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(81)90013-5"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1137\/0214065"},{"key":"R5","unstructured":"C. Hoang, Ph.D. Thesis, McGill University, Montreal, Canada,  1985"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1002\/sapm198981179"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52048-1_28"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(92)90036-A"},{"key":"R9","unstructured":"H. Lerchs,  On cliques and kernels, Department of Computer Science, University of Toronto, Toronto, Ontario,  1971, March"},{"key":"R10","unstructured":"H. Lerchs,  On the clique-kernel structure of graphs, Department of Computer Science, University of Toronto, Toronto, Ontario,  1972, October"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0221027","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:55:24Z","timestamp":1787338524000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0221027"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["10.1137\/0221027"],"URL":"https:\/\/doi.org\/10.1137\/0221027","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}