{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:24Z","timestamp":1740107124863,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:00:00Z","timestamp":1712361600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T00:00:00Z","timestamp":1712361600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s00373-024-02772-x","type":"journal-article","created":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T08:02:14Z","timestamp":1712390534000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The primality graph of critical 3-hypergraphs"],"prefix":"10.1007","volume":"40","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":[[2024,4,6]]},"reference":[{"key":"2772_CR1","doi-asserted-by":"publisher","first-page":"2839","DOI":"10.1016\/j.disc.2008.07.015","volume":"309","author":"Y Boudabbous","year":"2009","unstructured":"Boudabbous, Y., Ille, P.: Indecomposability graph and critical vertices of an indecomposable graph. Discrete Math. 309, 2839\u20132846 (2009)","journal-title":"Discrete Math."},{"key":"2772_CR2","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":"2772_CR3","doi-asserted-by":"publisher","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":"2772_CR4","doi-asserted-by":"publisher","first-page":"2737","DOI":"10.1007\/s00373-021-02391-w","volume":"37","author":"A Boussa\u00efri","year":"2021","unstructured":"Boussa\u00efri, A., Chergui, B., Ille, P., Zaidi, M.: Prime 3-uniform hypergraphs. Graphs Combin. 37, 2737\u20132760 (2021)","journal-title":"Graphs Combin."},{"key":"2772_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00373-022-02595-8","volume":"39","author":"A Boussa\u00efri","year":"2023","unstructured":"Boussa\u00efri, A., Chergui, B., Ille, P., Zaidi, M.: Critical 3-hypergraphs. Graphs Combin. 39, 3 (2023)","journal-title":"Graphs Combin."},{"key":"2772_CR6","doi-asserted-by":"publisher","DOI":"10.1142\/4197","volume-title":"The Theory of 2-Structures","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":"2772_CR7","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":"2772_CR8","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-94-011-2080-7_13","volume-title":"Finite and Infinite Combinatorics in Sets and Logic","author":"P Ille","year":"1993","unstructured":"Ille, P.: Recognition problem in reconstruction for decomposable relations. In: Sands, B., Sauer, N., Woodrow, R. (eds.) Finite and Infinite Combinatorics in Sets and Logic, pp. 189\u2013198. Kluwer Academic Publishers, London (1993)"},{"key":"2772_CR9","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":"2772_CR10","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":"2772_CR11","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-024-02772-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-024-02772-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-024-02772-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,23]],"date-time":"2024-07-23T04:03:03Z","timestamp":1721707383000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-024-02772-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,6]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["2772"],"URL":"https:\/\/doi.org\/10.1007\/s00373-024-02772-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2024,4,6]]},"assertion":[{"value":"31 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 April 2024","order":3,"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"}}],"article-number":"49"}}