{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T04:01:53Z","timestamp":1748404913146,"version":"3.41.0"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T00:00:00Z","timestamp":1737417600000},"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":[[2025,2]]},"DOI":"10.1007\/s00373-025-02888-8","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T18:39:19Z","timestamp":1737484759000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["When a Decomposable Tournament is $$\\{-1,3\\}$$-Reconstructible?"],"prefix":"10.1007","volume":"41","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2625-504X","authenticated-orcid":false,"given":"Pierre","family":"Ille","sequence":"first","affiliation":[]},{"given":"Soufiane","family":"Lakhlifi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,1,21]]},"reference":[{"key":"2888_CR1","first-page":"1229","volume":"316","author":"M Basso-Gerbelli","year":"1993","unstructured":"Basso-Gerbelli, M., Ille, P.: La reconstruction des relations binaires d\u00e9finies par interdits, C.R. Acad. Sci. Paris S\u00e9rie I Math. 316, 1229\u20131234 (1993)","journal-title":"Acad. Sci. Paris S\u00e9rie I Math."},{"key":"2888_CR2","unstructured":"Boudabbous, Y.: Hypomorphie et dualit\u00e9 dans la reconstruction selon Fra\u00efss\u00e9 des relations et des tournois, PhD Dissertation (unpublished), Universit\u00e9 de Savoie, (1994)"},{"key":"2888_CR3","first-page":"1037","volume":"326","author":"Y Boudabbous","year":"1998","unstructured":"Boudabbous, Y., Dammak, J.: Sur la $$(-k)$$-demi-reconstructibilit\u00e9 des tournois finis, C.R. Acad. Sci. Paris S\u00e9rie I Math. 326, 1037\u20131040 (1998)","journal-title":"Acad. Sci. Paris S\u00e9rie I Math."},{"key":"2888_CR4","doi-asserted-by":"publisher","first-page":"743","DOI":"10.7151\/dmgt.2059","volume":"38","author":"Y Boudabbous","year":"2018","unstructured":"Boudabbous, Y., Ille, P.: The $$\\lbrace -2,-1\\rbrace $$-selfdual and decomposable tournaments. Discuss. Math. Graph Theory 38, 743\u2013789 (2018)","journal-title":"Discuss. Math. Graph Theory"},{"key":"2888_CR5","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":"2888_CR6","doi-asserted-by":"publisher","first-page":"xvi+290","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, p. xvi+290. World Scientific, Singapore (1999)"},{"key":"2888_CR7","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/BF02020961","volume":"18","author":"T Gallai","year":"1967","unstructured":"Gallai, T.: Transitiv orientierbare Graphen. Acta Math. Acad. Sci. Hungar. 18, 25\u201366 (1967)","journal-title":"Acta Math. Acad. Sci. Hungar."},{"key":"2888_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1002\/malq.19920380124","volume":"38","author":"C Gnanvo","year":"1992","unstructured":"Gnanvo, C., Ille, P.: La reconstruction des tournois sans diamant. Z. Math. Logik Grundlag. Math. 38, 283\u2013291 (1992)","journal-title":"Z. Math. Logik Grundlag. Math."},{"key":"2888_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":"2888_CR10","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF01299955","volume":"71","author":"F Harary","year":"1967","unstructured":"Harary, F., Palmer, E.: On the problem of reconstructing a tournament from subtournaments. Monatsch. Math. 71, 14\u201323 (1967)","journal-title":"Monatsch. Math."},{"key":"2888_CR11","first-page":"25","volume-title":"Perfect Graphs","author":"F Maffray","year":"2001","unstructured":"Maffray, F., Preissmann, M.: A translation of Tibor Gallai\u2019s paper: Transitiv orientierbare Graphen. In: Ramirez-Alfonsin, J.L., Reed, B.A. (eds.) Perfect Graphs, pp. 25\u201366. Wiley, New York (2001)"},{"key":"2888_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/PL00012404","volume":"64","author":"P Maynard","year":"2002","unstructured":"Maynard, P., Siemons, J.: On the reconstruction index of permutation groups: semiregular groups. Aequationes Math. 64, 218\u2013231 (2002)","journal-title":"Aequationes Math."},{"key":"2888_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.4153\/CMB-1979-010-7","volume":"22","author":"JW Moon","year":"1979","unstructured":"Moon, J.W.: Tournaments whose subtournaments are irreducible or transitive. Can. Math. Bull. 22, 75\u201379 (1979)","journal-title":"Can. Math. Bull."},{"key":"2888_CR14","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":"2888_CR15","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."},{"key":"2888_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1002\/jgt.3190010108","volume":"1","author":"PK Stockmeyer","year":"1977","unstructured":"Stockmeyer, P.K.: The falsity of the reconstruction conjecture for tournaments. J. Graph Theory 1, 19\u201325 (1977)","journal-title":"J. Graph Theory"},{"key":"2888_CR17","volume-title":"A Collection of Mathematical Problems","author":"SM Ulam","year":"1960","unstructured":"Ulam, S.M.: A Collection of Mathematical Problems. Intersciences Publishers, New York (1960)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02888-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00373-025-02888-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-025-02888-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T04:22:47Z","timestamp":1748319767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00373-025-02888-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,21]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["2888"],"URL":"https:\/\/doi.org\/10.1007\/s00373-025-02888-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2025,1,21]]},"assertion":[{"value":"10 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 January 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 January 2025","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":"26"}}