{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:08Z","timestamp":1720640768820},"reference-count":15,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T00:00:00Z","timestamp":1096588800000},"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":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2004,10]]},"DOI":"10.1016\/j.endm.2004.03.032","type":"journal-article","created":{"date-parts":[[2005,4,14]],"date-time":"2005-04-14T13:54:58Z","timestamp":1113486898000},"page":"163-167","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["On -sparse graphs and other families"],"prefix":"10.1016","volume":"17","author":[{"given":"Jean-Luc","family":"Fouquet","sequence":"first","affiliation":[]},{"given":"Jean-Marie","family":"Vanherpe","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2004.03.032_bib001","doi-asserted-by":"crossref","unstructured":"L. Babel and S. Olariu. On the isomorphism of graphs with few P4s. Lecture notes in Computer Science, 944, WG 95:24\u201336, 1995","DOI":"10.1007\/3-540-60618-1_63"},{"key":"10.1016\/j.endm.2004.03.032_bib002","doi-asserted-by":"crossref","unstructured":"L. Babel and S. Olariu. A new characterisation of P4-connected graphs. Lecture notes in Computer Science, 1197,WG 96:17\u201330, 1996","DOI":"10.1007\/3-540-62559-3_3"},{"key":"10.1016\/j.endm.2004.03.032_bib003","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02352694","article-title":"Dominating cliques in P5-free graphs","volume":"21","author":"Bacs\u00f3","year":"1990","journal-title":"Periodica Mathematica Hungaria"},{"key":"10.1016\/j.endm.2004.03.032_bib004","unstructured":"A. Brandst\u00e4t and D. Kratsch. On the structure of (P5, gem)-free graphs. 2002. To appear in Discrete Applied Mathematics"},{"key":"10.1016\/j.endm.2004.03.032_bib005","article-title":"On the structure and stability number of P5 and co-chair-free graphs","author":"Brandst\u00e4t","year":"2003","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.endm.2004.03.032_bib006","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":"Journal of Graph Theory"},{"key":"10.1016\/j.endm.2004.03.032_bib007","first-page":"1","article-title":"Linear time solvable optimization problems on graphs of bounded clique width","volume":"1517","author":"Courcelle","year":"1998"},{"key":"10.1016\/j.endm.2004.03.032_bib008","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0012-365X(93)90539-6","article-title":"A decomposition for a class of (P5,P\u00af5)-free graphs","volume":"121","author":"Fouquet","year":"1993","journal-title":"Discrete Mathematics"},{"key":"10.1016\/j.endm.2004.03.032_bib009","unstructured":"J.L. Fouquete and J.M. Vanherpe. On bipartite graphs with weak density of some subgraphs. 2003. To appear in the special issue of Discrete Mathematics devoted to the Fourth Cracow Conference on Graph Theory \u201cCzorsztyn '02\u201d"},{"key":"10.1016\/j.endm.2004.03.032_bib010","doi-asserted-by":"crossref","first-page":"17","DOI":"10.46298\/dmtcs.232","article-title":"On P4-tidy graphs","volume":"1","author":"Giakoumakis","year":"1997","journal-title":"Discrete Mathematics and Theoretical Computer Science"},{"key":"10.1016\/j.endm.2004.03.032_bib011","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0166-218X(97)00093-0","article-title":"Weighted parameters in (P5,P\u00af5)-free graphs","volume":"80","author":"Giakoumakis","year":"1997","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.endm.2004.03.032_bib012","unstructured":"C.T. Ho\u00e0ng. Perfect Graphs, PhD thesis, School of Computer Science, McGill University, Montreal, 1985"},{"key":"10.1016\/j.endm.2004.03.032_bib013","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0166-218X(94)90004-3","article-title":"Efficient algorithms for minimum weighted colouring of some classes of perfect graphs","volume":"55","author":"Ho\u00e0ng","year":"1994","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/j.endm.2004.03.032_bib014","first-page":"257","article-title":"Substitution decomposition for discrete structures and connections with combinatorial optimization","volume":"19","author":"M\u00f6hring","year":"1984","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/j.endm.2004.03.032_bib015","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1142\/S0129054199000083","article-title":"On graphs with limited number of P4-partners","volume":"10","author":"Roussel","year":"1999","journal-title":"International Journal of Fundations of Computer Science"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304010327?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304010327?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,5,2]],"date-time":"2023-05-02T23:18:10Z","timestamp":1683069490000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304010327"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10]]},"references-count":15,"alternative-id":["S1571065304010327"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2004.03.032","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2004,10]]}}}