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

DOI10.2298/FIL1913307BMaRDI QIDQ5863935zbMATH OpenOpenAlexFDO

Authors 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

difference classhereditarily isomorphicisomorphismmodular decompositionprechainreconstruction

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

• \((\leq k)\)-reconstructible binary relations
• \(\{-1\}\)-self dual finite prechains and applications
• \(P_ 4\)-trees and substitution decomposition
• A translation of Gallai's paper: `Transitiv orientierbare Graphen'
• Application d'une propriété combinatoire des parties d'un ensemble aux groupes et aux rélations
• Boolean sum of graphs and reconstruction up to complementation
• Claw-freeness, 3-homogeneous subsets of a graph and a reconstruction problem
• Description of the tournaments which are reconstructible from their \(k\)-cycle partial digraphs for \(k\in \{3, 4\}\)
• Graph reconstruction—a survey
• Hereditary isomorphy and \(\{-4\}\)-hypomorphy for tournaments
• scientific article; zbMATH DE number 458873 (Why is no real title available?)
• scientific article; zbMATH DE number 3141308 (Why is no real title available?)
• scientific article; zbMATH DE number 3916273 (Why is no real title available?)
• scientific article; zbMATH DE number 4039949 (Why is no real title available?)
• scientific article; zbMATH DE number 17789 (Why is no real title available?)
• scientific article; zbMATH DE number 1478125 (Why is no real title available?)
• scientific article; zbMATH DE number 3334164 (Why is no real title available?)
• scientific article; zbMATH DE number 3375499 (Why is no real title available?)
• scientific article; zbMATH DE number 3394133 (Why is no real title available?)
• Hypomorphy of graphs up to complementation
• Isomorphy and dilatation in digraphs
• Isomorphy up to complementation
• L'Indeformabilite des Relations et Multirelations Binaires
• La 5-reconstructibilité et l'indécomposabilité des relations binaires. (The 5-reconstructibility and indecomposability of binary relations)
• La dualité dans la demi-reconstruction des relations binaires finies
• Modules of Coherent Binary Systems
• Prechains and self duality
• Primitivity is hereditary for 2-structures
• Reconstruction from the deck of k-vertex induced subgraphs
• 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
• Rélations non reconstructibles par leurs restrictions
• Strongly self-complementary and hereditarily isomorphic tournaments
• Sur la (-k)-demi-reconstructibilité des tournois finis
• Sur la détermination d'une relation binaire à partir d'informations locales
• The \({-k}\)-self-duality of finite lexicographic sums of tournaments under a 3-cycle or a critical tournament
• The falsity of the reconstruction conjecture for tournaments
• The half-isomorphy and the finite strongly connected tournaments
• The minimal non-( k)-reconstructible relations
• Transitiv orientierbare Graphen

Cited in

(2)

• scientific article; zbMATH DE number 5016654 (Why is no real title available?)
• Description of the digraphs \(\{-1\}\)-hypomorphic to a reducible digraph

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

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