The half-isomorphy and the finite strongly connected tournaments

DOI10.1016/S1631-073X(02)02439-1MaRDI QIDQ698691zbMATH OpenFDO

Authors Moncef Bouaziz, Youssef Boudabbous

Publication date 11 February 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) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Half-isomorphy, selfduality and finite non strongly connected tournaments
• Isomorphism and canonization of tournaments and hypertournaments
• On Isomorphism and Canonization of Tournaments and Hypertournaments
• Tournaments associated with multigraphs and a theorem of Hakimi
• On an adjacency property of almost all tournaments
• Sur la (-k)-demi-reconstructibilité des tournois finis
• On the number of nonseparating vertices in strongly connected in-tournaments
• Tournaments and Semicomplete Digraphs
• scientific article; zbMATH DE number 3214408
• On the connectivity of close to regular multipartite tournaments

Cites work

• scientific article; zbMATH DE number 458873 (Why is no real title available?)
• scientific article; zbMATH DE number 458918 (Why is no real title available?)
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3334164 (Why is no real title available?)
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures
• La relation différence et l'anti‐isomorphie
• On the problem of reconstructing a tournament from subtournaments
• Primitivity is hereditary for 2-structures
• Sur la (-k)-demi-reconstructibilité des tournois finis
• Transitiv orientierbare Graphen

Cited in

(6)

• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• Half-isomorphy, selfduality and finite non strongly connected tournaments
• Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
• Reconstructible and Half-Reconstructible Tournaments: Application to Their Groups of Hemimorphisms
• The pairs of \(\{-3\}\)-hypomorphic tournaments
• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic

This page was built for publication: The half-isomorphy and the finite strongly connected tournaments

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