{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:02:11Z","timestamp":1760954531701},"reference-count":15,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2004,2,1]],"date-time":"2004-02-01T00:00:00Z","timestamp":1075593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3490,"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":[[2004,2]]},"DOI":"10.1016\/s0012-365x(03)00244-9","type":"journal-article","created":{"date-parts":[[2003,9,11]],"date-time":"2003-09-11T23:43:33Z","timestamp":1063323813000},"page":"29-43","source":"Crossref","is-referenced-by-count":18,"title":["The C3-structure of the tournaments"],"prefix":"10.1016","volume":"277","author":[{"given":"Abderrahim","family":"Boussa\u00efri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Ille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e9rard","family":"Lopez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phan","family":"Thomass\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(03)00244-9_BIB1","first-page":"125","article-title":"Hypomorphie et inversion locale entre graphes","volume":"317","author":"Boussa\u0131&#x0308;ri","year":"1993","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I"},{"key":"10.1016\/S0012-365X(03)00244-9_BIB2","unstructured":"A. Cournier, M. Habib, An efficient algorithm to recognize prime undirected graphs, in: E.W. Mayr (Ed.), Lecture Notes in Computer Science, 657. Graph-theoretic Concepts in Computer Science, Proceedings of the 18th Internat. Workshop, WG\u201992, Wiesbaden-Naurod, Germany, June 1992, Springer, Berlin, 1993, pp. 212\u2013224."},{"key":"10.1016\/S0012-365X(03)00244-9_BIB3","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/S0012-365X(97)00077-0","article-title":"Minimal indecomposable graphs","volume":"183","author":"Cournier","year":"1998","journal-title":"Discrete Math."},{"issue":"70","key":"10.1016\/S0012-365X(03)00244-9_BIB4","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0304-3975(90)90131-Z","article-title":"Primitivity is hereditary for 2-structures, fundamental study","volume":"3","author":"Ehrenfeucht","year":"1990","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0012-365X(03)00244-9_BIB5","first-page":"203","article-title":"Abritement entre relations et sp\u00e9cialement entre cha\u0131&#x0302;nes","volume":"5","author":"Fra\u0131&#x0308;ss\u00e9","year":"1970","journal-title":"Sympos. Math."},{"key":"10.1016\/S0012-365X(03)00244-9_BIB6","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. Hungar."},{"key":"10.1016\/S0012-365X(03)00244-9_BIB7","first-page":"1370","article-title":"Caract\u00e9risation des graphes non orient\u00e9s dont on peut orienter les ar\u00eates de mani\u00e8re \u00e0 obtenir le graphe d'une relation d'ordre","volume":"254","author":"Ghouila-Hari","year":"1962","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I"},{"key":"10.1016\/S0012-365X(03)00244-9_BIB8","unstructured":"M. Habib, Substitution des structures combinatoires, th\u00e9orie et algorithmes, Ph.D. Thesis, Universit\u00e9 Pierre et Marie Curie, Paris VI, 1981."},{"key":"10.1016\/S0012-365X(03)00244-9_BIB9","first-page":"7","article-title":"La demi-reconstructibilit\u00e9 des relations binaires de cardinal >12","volume":"317","author":"Hagendorf","year":"1993","journal-title":"C.R. Acad. Sci. Paris S\u00e9r. I"},{"key":"10.1016\/S0012-365X(03)00244-9_BIB10","first-page":"499","article-title":"Graphes ind\u00e9composables infinis","volume":"318","author":"Ille","year":"1994","journal-title":"C. R. Acad. Sci. Paris S\u00e9r. I"},{"key":"10.1016\/S0012-365X(03)00244-9_BIB11","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/S0012-365X(96)00097-0","article-title":"Indecomposable graphs","volume":"173","author":"Ille","year":"1997","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(03)00244-9_BIB12","series-title":"Graphs and Orders","first-page":"3","article-title":"Comparability graphs","author":"Kelly","year":"1985"},{"key":"10.1016\/S0012-365X(03)00244-9_BIB13","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/malq.19780241905","article-title":"L'ind\u00e9formabilit\u00e9 des relations et multirelations binaires","volume":"24","author":"Lopez","year":"1978","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"10.1016\/S0012-365X(03)00244-9_BIB14","series-title":"Perfect Graphs","first-page":"25","article-title":"A translation of Tibor Gallai's paper: Transitiv orientierbare graphen","author":"Maffray","year":"2001"},{"key":"10.1016\/S0012-365X(03)00244-9_BIB15","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":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002449?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X03002449?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T17:25:57Z","timestamp":1551029157000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X03002449"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,2]]},"references-count":15,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2004,2]]}},"alternative-id":["S0012365X03002449"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(03)00244-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[2004,2]]}}}