F3-Reconstruction and Bi-Founded 2-Structures

DOI10.1007/S11083-022-09610-WMaRDI QIDQ6493758zbMATH OpenFDO

Authors Youssef Boudabbous, Christian Delhommé

Publication date 29 April 2024

Published in Order (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11083-022-09610-W

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Infinite graphs (05C63)

Recommendations

• Description of the ( 3)-hypomorphic posets and bichains. Application to the ( 3)-reconstruction.
• Procédé de construction des relations binaires non (≤ 3)-reconstructibles
• \((\leq k)\)-reconstructible binary relations
• scientific article; zbMATH DE number 417290
• The minimal non-( k)-reconstructible relations

Cites work

• \((\leq k)\)-reconstructible binary relations
• Characterization of the ( 3)-hypomorphy classes with the aid of interdictions
• Decomposition of Directed Graphs
• Decomposition of infinite labeled 2-structures
• L'Indeformabilite des Relations et Multirelations Binaires
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• 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
• The \(C_{3}\)-structure of the tournaments.
• The minimal non-( k)-reconstructible relations
• The modular decomposition of countable graphs. Definition and construction in monadic second-order logic
• Transitiv orientierbare Graphen

Cited in

(1)

• Description of the ( 3)-hypomorphic posets and bichains. Application to the ( 3)-reconstruction.

This page was built for publication: F3-Reconstruction and Bi-Founded 2-Structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6493758)