Half-isomorphy, selfduality and finite non strongly connected tournaments

DOI10.1016/S1631-073X(02)02498-6zbMath1009.05064MaRDI QIDQ1854668

Youssef Boudabbous, Moncef Bouaziz

Publication date: 1 May 2003

Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Other classical set theory (including functions, relations, and set algebra) (03E20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)

Cites Work

• Unnamed Item
• Unnamed Item
• The half-isomorphy and the finite strongly connected tournaments
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Strongly self-complementary and hereditarily isomorphic tournaments
• Indecomposability and duality of tournaments
• L'Indeformabilite des Relations et Multirelations Binaires
• Sur la (-k)-demi-reconstructibilité des tournois finis
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
• La relation différence et l'anti‐isomorphie

This page was built for publication: Half-isomorphy, selfduality and finite non strongly connected tournaments