The half-isomorphy and the finite strongly connected tournaments

DOI10.1016/S1631-073X(02)02439-1zbMath1005.05032MaRDI QIDQ698691

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)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primitivity is hereditary for 2-structures
• 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
• On the problem of reconstructing a tournament from subtournaments
• Sur la (-k)-demi-reconstructibilité des tournois finis
• La relation différence et l'anti‐isomorphie
• Transitiv orientierbare Graphen

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