Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic

DOI10.2298/FIL1913307BzbMath1499.05253OpenAlexW3006680924MaRDI QIDQ5863935

Youssef Boudabbous

Publication date: 3 June 2022

Published in: Filomat (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2298/fil1913307b

zbMATH Keywords

isomorphismreconstructionmodular decompositionprechaindifference classhereditarily isomorphic

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isomorphy up to complementation
• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• \(\{-1\}\)-self dual finite prechains and applications
• Prechains and self duality
• The half-isomorphy and the finite strongly connected tournaments
• Primitivity is hereditary for 2-structures
• \(P_ 4\)-trees and substitution decomposition
• Rélations non reconstructibles par leurs restrictions
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Strongly self-complementary and hereditarily isomorphic tournaments
• The minimal non-\((\leqslant k)\)-reconstructible relations
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
• \((\leq k)\)-reconstructible binary relations
• Hypomorphy of graphs up to complementation
• Boolean sum of graphs and reconstruction up to complementation
• Isomorphy and dilatation in digraphs
• The falsity of the reconstruction conjecture for tournaments
• Graph reconstruction—a survey
• L'Indeformabilite des Relations et Multirelations Binaires
• Sur la (-k)-demi-reconstructibilité des tournois finis
• La dualité dans la demi-reconstruction des relations binaires finies
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) II
• Sur la détermination d'une relation binaire à partir d'informations locales
• Reconstruction from the deck of ‐vertex induced subgraphs
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
• Transitiv orientierbare Graphen
• Modules of Coherent Binary Systems

This page was built for publication: Two {4,n-3}-isomorphic n-vertex digraphs are hereditarily isomorphic