F3-Reconstruction and Bi-Founded 2-Structures
From MaRDI portal
Publication:6493758
DOI10.1007/S11083-022-09610-WMaRDI QIDQ6493758
Christian Delhommé, Youssef Boudabbous
Publication date: 29 April 2024
Published in: Order (Search for Journal in Brave)
Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63)
Cites Work
- The \(C_{3}\)-structure of the tournaments.
- The minimal non-\((\leqslant k)\)-reconstructible relations
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
- \((\leq k)\)-reconstructible binary relations
- The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
- Caracterisation des classes de (≤ 3)-hypomorphie a l'aide d'interdits
- Decomposition of Directed Graphs
- L'Indeformabilite des Relations et Multirelations Binaires
- RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
- RESTRICTION RESPECTUEUSE ET RECONSTRUCTION DES CHAINES ET DES RELATIONS INFINITES
- Transitiv orientierbare Graphen
- Decomposition of infinite labeled 2-structures
This page was built for publication: F3-Reconstruction and Bi-Founded 2-Structures
