The following pages link to Youssef Boudabbous (Q343740):
Displaying 42 items.
- Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\) (Q343743) (← links)
- \(\{-1\}\)-self dual finite prechains and applications (Q392596) (← links)
- 3-minimal triangle-free graphs (Q397131) (← links)
- Prechains and self duality (Q418880) (← links)
- The pairs of \(\{-3\}\)-hypomorphic tournaments (Q432667) (← links)
- Critically twin primitive 2-structures (Q497313) (← links)
- Prime orders all of whose prime suborders are selfdual (Q603888) (← links)
- The half-isomorphy and the finite strongly connected tournaments (Q698691) (← links)
- \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\) (Q950116) (← links)
- The morphology of infinite tournaments; application to the growth of their profile (Q966158) (← links)
- Graphs critically without duo (Q1018107) (← links)
- (Q1043636) (redirect page) (← links)
- Indecomposability graph and critical vertices of an indecomposable graph (Q1043637) (← links)
- Indecomposability and duality of tournaments (Q1587596) (← links)
- The \(\{-2,-1\}\)-selfdual and decomposable tournaments (Q1649912) (← links)
- The minimal non-\((\leqslant k)\)-reconstructible relations (Q1772265) (← links)
- Half-isomorphy, selfduality and finite non strongly connected tournaments (Q1854668) (← links)
- La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations) (Q1864566) (← links)
- Finite orders which are reconstructible up to duality by their comparability graphs (Q1988547) (← links)
- Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments (Q2271991) (← links)
- \((\leq k)\)-reconstructible binary relations (Q2434745) (← links)
- Finite tournaments with a nonempty diamonds' support (Q2637718) (← links)
- The {-3}-reconstruction and the {-3}-self duality of tournaments (Q2823223) (← links)
- HEREDITARY HEMIMORPHY OF {-κ}-HEMIMORPHIC TOURNAMENTS FOR ≥ 5 (Q3002680) (← links)
- (Q3558635) (← links)
- Cut-primitive directed graphs versus clan-primitive directed graphs (Q3576334) (← links)
- Sur la (-k)-demi-reconstructibilité des tournois finis (Q4218652) (← links)
- Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms (Q4264542) (← links)
- (Q4302980) (← links)
- Sur la détermination d'une relation binaire à partir d'informations locales (Q4393173) (← links)
- Clôture transitive et reconstruction (Q4511634) (← links)
- (Q4583735) (← links)
- (Q4583873) (← links)
- (Q4583874) (← links)
- (Q4583890) (← links)
- La relation différence et l'anti‐isomorphie (Q4835530) (← links)
- (Q4854730) (← links)
- Procédé de construction des relations binaires non (≤ 3)-reconstructibles (Q4937434) (← links)
- (Q4963168) (← links)
- (Q5310207) (← links)
- Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic (Q5863935) (← links)
- F3-Reconstruction and Bi-Founded 2-Structures (Q6493758) (← links)
