{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:15:51Z","timestamp":1765610151791,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T00:00:00Z","timestamp":1629676800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2021,11]]},"DOI":"10.1007\/s00373-021-02391-w","type":"journal-article","created":{"date-parts":[[2021,8,23]],"date-time":"2021-08-23T15:06:03Z","timestamp":1629731163000},"page":"2737-2760","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Prime 3-Uniform Hypergraphs"],"prefix":"10.1007","volume":"37","author":[{"given":"Abderrahim","family":"Boussa\u00efri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brahim","family":"Chergui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2625-504X","authenticated-orcid":false,"given":"Pierre","family":"Ille","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Zaidi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,23]]},"reference":[{"key":"2391_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1006\/jagm.1999.1016","volume":"32","author":"P Bonizzoni","year":"1999","unstructured":"Bonizzoni, P., Della Vedova, G.: An algorithm for the modular decomposition of hypergraphs. J. Algorithms 32, 65\u201386 (1999)","journal-title":"J. Algorithms"},{"key":"2391_CR2","doi-asserted-by":"publisher","first-page":"1223","DOI":"10.1007\/s00373-014-1436-y","volume":"31","author":"Y Boudabbous","year":"2015","unstructured":"Boudabbous, Y., Ille, P., Jouve, B., Salhi, A.: Critically twin primitive 2-structures. Graphs Combin. 31, 1223\u20131247 (2015)","journal-title":"Graphs Combin."},{"key":"2391_CR3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.55016\/ojs\/cdm.v15i1.67935","volume":"15","author":"A Boussa\u00efri","year":"2020","unstructured":"Boussa\u00efri, A., Chergui, B., Ille, P., Zaidi, M.: 3-uniform hypergraphs: modular decomposition and realization by tournaments. Contrib. Discrete Math. 15, 121\u2013153 (2020)","journal-title":"Contrib. Discrete Math."},{"key":"2391_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/S0012-365X(03)00244-9","volume":"277","author":"A Boussa\u00efri","year":"2004","unstructured":"Boussa\u00efri, A., Ille, P., Lopez, G., Thomass\u00e9, S.: The $$C_{3}$$-structure of the tournaments. Discrete Math. 277, 29\u201343 (2004)","journal-title":"Discrete Math."},{"key":"2391_CR5","first-page":"1","volume":"16","author":"M Burley","year":"1982","unstructured":"Burley, M., Uhry, J.P.: Parity graphs. Ann. Discrete Math. 16, 1\u201326 (1982)","journal-title":"Ann. Discrete Math."},{"key":"2391_CR6","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(81)90138-2","volume":"37","author":"M Chein","year":"1981","unstructured":"Chein, M., Habib, M., Maurer, M.C.: Partitive hypergraphs. Discrete Math. 37, 35\u201350 (1981)","journal-title":"Discrete Math."},{"key":"2391_CR7","doi-asserted-by":"publisher","DOI":"10.1142\/4197","volume-title":"The Theory of 2-Structures. A Framework for Decomposition and Transformation of Graphs","author":"A Ehrenfeucht","year":"1999","unstructured":"Ehrenfeucht, A., Harju, T., Rozenberg, G.: The Theory of 2-Structures. A Framework for Decomposition and Transformation of Graphs. World Scientific, Singapore (1999)"},{"key":"2391_CR8","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/0304-3975(90)90131-Z","volume":"70","author":"A Ehrenfeucht","year":"1990","unstructured":"Ehrenfeucht, A., Rozenberg, G.: Primitivity is hereditary for 2-structures. Theor. Comput. Sci. 70, 343\u2013358 (1990)","journal-title":"Theor. Comput. Sci."},{"key":"2391_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/S0895480193251234","volume":"9","author":"D Haglin","year":"1996","unstructured":"Haglin, D., Wolf, M.: On convex subsets in tournaments. SIAM J. Discrete Math. 9, 63\u201370 (1996)","journal-title":"SIAM J. Discrete Math."},{"key":"2391_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/S0012-365X(96)00097-0","volume":"173","author":"P Ille","year":"1997","unstructured":"Ille, P.: Indecomposable graphs. Discrete Math. 173, 71\u201378 (1997)","journal-title":"Discrete Math."},{"key":"2391_CR11","first-page":"52","volume":"6","author":"MY Sayar","year":"2011","unstructured":"Sayar, M.Y.: Partially critical indecomposable tournaments and partially critical supports. Contrib. Discrete Math. 6, 52\u201376 (2011)","journal-title":"Contrib. Discrete Math."},{"key":"2391_CR12","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0012-365X(93)90516-V","volume":"113","author":"JH Schmerl","year":"1993","unstructured":"Schmerl, J.H., Trotter, W.T.: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures. Discrete Math. 113, 191\u2013205 (1993)","journal-title":"Discrete Math."},{"key":"2391_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(92)90180-I","volume":"39","author":"J Spinrad","year":"1992","unstructured":"Spinrad, J.: P4-trees and substitution decomposition. Discrete Appl. Math. 39, 263\u2013291 (1992)","journal-title":"Discrete Appl. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02391-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-021-02391-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-021-02391-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:15:07Z","timestamp":1725678907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-021-02391-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,23]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2021,11]]}},"alternative-id":["2391"],"URL":"https:\/\/doi.org\/10.1007\/s00373-021-02391-w","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2021,8,23]]},"assertion":[{"value":"16 May 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 February 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 July 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}