Sur la (-k)-demi-reconstructibilité des tournois finis

DOI10.1016/S0764-4442(98)80010-4zbMATH Open0915.05091MaRDI QIDQ4218652FDOQ4218652

Authors: Youssef Boudabbous, Jamel Dammak 

Publication date: 22 June 1999

Published in: Comptes Rendus de l'Académie des Sciences - Series I - Mathematics (Search for Journal in Brave)

Recommendations

• \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\)
• scientific article; zbMATH DE number 817353
• The \(\{-3\}\)-reconstruction and the \(\{-3\}\)-self duality of tournaments.
• The pairs of \(\{-3\}\)-hypomorphic tournaments

zbMATH Keywords

reconstructionisomorphictournament

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cited In (20)

• Title not available (Why is that?)
• LA RECONSTRUCTION DES TOURNOIS SANS DIAMANT
• The \((\leq 6)\)-half-reconstructibility of digraphs
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
• Title not available (Why is that?)
• \((\leqslant k)\)-half-reconstructible tournaments for \(k\leqslant 6\)
• The \(\{-2,-1\}\)-selfdual and decomposable tournaments
• On Stockmeyer's non-reconstructible tournaments
• The \((-1)\)-critical tournaments
• Title not available (Why is that?)
• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• The pairs of \(\{-3\}\)-hypomorphic tournaments
• The \((-5)\)-demi-reconstructibility of finite related binary relations
• The threshold for top-down reconstructibility modulo the duality of finite binary relations
• A short proof of a theorem of Reid and Parker on tournaments
• The half-isomorphy and the finite strongly connected tournaments
• The \(\{-3\}\)-reconstruction and the \(\{-3\}\)-self duality of tournaments.
• The \((-1)\)-critically duo-free tournaments.
• Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
• Half-isomorphy, selfduality and finite non strongly connected tournaments

This page was built for publication: Sur la (-k)-demi-reconstructibilité des tournois finis

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