{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T20:52:59Z","timestamp":1772484779350,"version":"3.50.1"},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.ejc.2026.104345","type":"journal-article","created":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T14:53:31Z","timestamp":1769784811000},"page":"104345","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Graph classes with few\n                    <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\" display=\"inline\" id=\"d1e498\" altimg=\"si38.svg\">\n                      <mml:msub>\n                        <mml:mrow>\n                          <mml:mi>P<\/mml:mi>\n                        <\/mml:mrow>\n                        <mml:mrow>\n                          <mml:mn>4<\/mml:mn>\n                        <\/mml:mrow>\n                      <\/mml:msub>\n                    <\/mml:math>\n                    \u2019s: Universality and Brownian graphon limits"],"prefix":"10.1016","volume":"134","author":[{"given":"Th\u00e9o","family":"Lenoir","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.ejc.2026.104345_b1","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1002\/rsa.21033","article-title":"Random cographs: Brownian graphon limit and asymptotic degree distribution","volume":"60","author":"Bassino","year":"2022","journal-title":"Random Structures Algorithms"},{"issue":"6","key":"10.1016\/j.ejc.2026.104345_b2","doi-asserted-by":"crossref","first-page":"1801","DOI":"10.1016\/j.aim.2008.07.008","article-title":"Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing","volume":"219","author":"Borgs","year":"2008","journal-title":"Adv. Math."},{"key":"10.1016\/j.ejc.2026.104345_b3","series-title":"Graph Classes: A Survey","author":"Brandst\u00e4dt","year":"1999"},{"issue":"4","key":"10.1016\/j.ejc.2026.104345_b4","doi-asserted-by":"crossref","first-page":"1277","DOI":"10.1137\/060664690","article-title":"A simple linear time lexBFS cograph recognition algorithm","volume":"22","author":"Bretscher","year":"2008","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"10.1016\/j.ejc.2026.104345_b5","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0166-218X(81)90013-5","article-title":"Complement reducible graphs","volume":"3","author":"Corneil","year":"1981","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.ejc.2026.104345_b6","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1137\/0214065","article-title":"A linear recognition algorithm for cographs","volume":"14","author":"Corneil","year":"1985","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/j.ejc.2026.104345_b7","first-page":"33","article-title":"Graph limits and exchangeable random graphs","volume":"28","author":"Diaconis","year":"2008","journal-title":"Rend. Mat."},{"key":"10.1016\/j.ejc.2026.104345_b8","series-title":"Analytic Combinatorics","author":"Flajolet","year":"2009"},{"key":"10.1016\/j.ejc.2026.104345_b9","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/BF02020961","article-title":"Transitiv orientierbare graphen","volume":"18","author":"Gallai","year":"1967","journal-title":"Acta Math. Acad. Sci. Hung."},{"key":"10.1016\/j.ejc.2026.104345_b10","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 Math. Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.ejc.2026.104345_b11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/S0304-3975(96)00220-4","article-title":"On extended P4-reducible and extended P4-sparse graphs","volume":"180","author":"Giakoumakis","year":"1997","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"10.1016\/j.ejc.2026.104345_b12","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/j.dam.2004.01.011","article-title":"A simple linear time algorithm for cograph recognition","volume":"145","author":"Habib","year":"2005","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.ejc.2026.104345_b13","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."},{"issue":"1","key":"10.1016\/j.ejc.2026.104345_b14","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."},{"issue":"1","key":"10.1016\/j.ejc.2026.104345_b15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/sapm198981179","article-title":"P4-reducible graphs\u2014Class of uniquely tree-representable graphs","volume":"81","author":"Jamison","year":"1989","journal-title":"Stud. Appl. Math."},{"issue":"1\u20133","key":"10.1016\/j.ejc.2026.104345_b16","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/0166-218X(91)90085-B","article-title":"On a unique tree representation for P4-extendible graphs","volume":"34","author":"Jamison","year":"1991","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/j.ejc.2026.104345_b17","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."},{"issue":"1","key":"10.1016\/j.ejc.2026.104345_b18","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/0304-3975(95)00016-P","article-title":"A linear-time recognition algorithm for P4-reducible graphs","volume":"145","author":"Jamison","year":"1995","journal-title":"Theor. Comput. Sc."},{"key":"10.1016\/j.ejc.2026.104345_b19","doi-asserted-by":"crossref","DOI":"10.1090\/coll\/060","article-title":"Large networks and graph limits","author":"Lov\u00e1sz","year":"2012"},{"key":"10.1016\/j.ejc.2026.104345_b20","series-title":"Graphs and Order: The Role of Graphs in the Theory of Ordered Sets and Its Applications","first-page":"41","article-title":"Algorithmic aspects of comparability graphs and interval graphs","author":"M\u00f6hring","year":"1985"},{"key":"10.1016\/j.ejc.2026.104345_b21","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1002\/rsa.21002","article-title":"Graphon convergence of random cographs","volume":"59","author":"Stufler","year":"2019","journal-title":"Random Struct. Algor."}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000132?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669826000132?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T19:53:21Z","timestamp":1772481201000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669826000132"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":21,"alternative-id":["S0195669826000132"],"URL":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104345","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Graph classes with few \u2019s: Universality and Brownian graphon limits","name":"articletitle","label":"Article Title"},{"value":"European Journal of Combinatorics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ejc.2026.104345","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104345"}}