Youssef Boudabbous

From MaRDI portal
Person:343740

Available identifiers

zbMath Open boudabbous.youssefMaRDI QIDQ343740

List of research outcomes





PublicationDate of PublicationType
F3-Reconstruction and Bi-Founded 2-Structures2024-04-29Paper
Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic2022-06-03Paper
Finite orders which are reconstructible up to duality by their comparability graphs2020-04-23Paper
https://portal.mardi4nfdi.de/entity/Q49631682018-11-06Paper
https://portal.mardi4nfdi.de/entity/Q45837352018-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45838732018-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45838902018-09-03Paper
https://portal.mardi4nfdi.de/entity/Q45838742018-09-03Paper
The \(\{-2,-1\}\)-selfdual and decomposable tournaments2018-06-29Paper
Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)2016-11-29Paper
The \(\{-3\}\)-reconstruction and the \(\{-3\}\)-self duality of tournaments.2016-10-06Paper
Critically twin primitive 2-structures2015-09-24Paper
3-minimal triangle-free graphs2014-08-08Paper
Finite tournaments with a nonempty diamonds' support2014-02-14Paper
\((\leq k)\)-reconstructible binary relations2014-02-07Paper
\(\{-1\}\)-self dual finite prechains and applications2014-01-14Paper
The pairs of \(\{-3\}\)-hypomorphic tournaments2012-07-04Paper
Prechains and self duality2012-05-30Paper
Hereditary hemimorphy of \(\{-k\}\)-hemimorphic tournaments for \(k \geq 5\)2011-05-23Paper
Prime orders all of whose prime suborders are selfdual2010-11-08Paper
Cut-primitive directed graphs versus clan-primitive directed graphs2010-07-30Paper
https://portal.mardi4nfdi.de/entity/Q35586352010-05-05Paper
The morphology of infinite tournaments; application to the growth of their profile2010-04-27Paper
Indecomposability graph and critical vertices of an indecomposable graph2009-12-09Paper
Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments2009-08-05Paper
Graphs critically without duo2009-05-13Paper
\((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\)2008-10-22Paper
The \({-k}\)-self-duality of finite lexicographic sums of tournaments under a 3-cycle or a critical tournament2007-09-21Paper
The minimal non-\((\leqslant k)\)-reconstructible relations2005-04-18Paper
Half-isomorphy, selfduality and finite non strongly connected tournaments2003-05-01Paper
La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)2003-03-18Paper
The half-isomorphy and the finite strongly connected tournaments2003-02-11Paper
Indecomposability and duality of tournaments2001-05-10Paper
Clôture transitive et reconstruction2001-01-11Paper
Procédé de construction des relations binaires non (≤ 3)-reconstructibles2000-04-10Paper
Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms1999-10-21Paper
Sur la (-k)-demi-reconstructibilité des tournois finis1999-06-22Paper
Sur la détermination d'une relation binaire à partir d'informations locales1998-12-02Paper
https://portal.mardi4nfdi.de/entity/Q48547301996-01-07Paper
La relation différence et l'anti‐isomorphie1995-09-11Paper
https://portal.mardi4nfdi.de/entity/Q43029801994-08-21Paper

Research outcomes over time

This page was built for person: Youssef Boudabbous