The half-isomorphy and the finite strongly connected tournaments

DOI10.1016/S1631-073X(02)02439-1zbMATH Open1005.05032MaRDI QIDQ698691FDOQ698691

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)

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

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

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

Cited In (6)

• Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic
• Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• The pairs of \(\{-3\}\)-hypomorphic 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: 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)