( k)-hereditarily reconstructible digraphs

zbMATH Open1486.05116MaRDI QIDQ5078313FDOQ5078313

Authors: Nadia El Amri 

Publication date: 23 May 2022

Full work available at URL: https://www.oldcitypublishing.com/journals/mvlsc-home/mvlsc-issue-contents/mvlsc-volume-34-number-5-6-2020/mvlsc-34-5-6-p-401-421/

Recommendations

• The \((\leq 6)\)-half-reconstructibility of digraphs
• Properties of non-reconstructible graphs and digraphs
• On the \(\{4,-k\}\)-hypomorphy for digraphs.
• Hereditary hemimorphy of \(\{ 5,-4\}\)-hemimorphic arc connected digraphs.
• More non-reconstructible hypergraphs

zbMATH Keywords

digraphisomorphyhereditary isomorphyhereditary reconstructibility

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

• Transitiv orientierbare Graphen
• Sur les graphes 2-reconstructibles (On the 2-reconstructible graphs)
• 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)
• \((\leq k)\)-reconstructible binary relations
• L'Indeformabilite des Relations et Multirelations Binaires
• Orders and (\(\leq 4\))-hemimorphy
• Title not available (Why is that?)
• Modules of Coherent Binary Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Prechains and self duality
• RECONSTRUCTION OF BINARY RELATIONS FROM THEIR RESTRICTIONS OF CARDINALITY 2, 3, 4 and (n ‐ 1) I
• Sur la détermination d'une relation binaire à partir d'informations locales
• The \((\leq k)\)-half-reconstructability of graphs for \(7\leq k\leq 12\).
• La relation différence et l'anti‐isomorphie
• The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)
• Strongly self-complementary and hereditarily isomorphic tournaments
• Procédé de construction des relations binaires non (≤ 3)-reconstructibles
• Characterization of the \((\leq 3)\)-hypomorphy classes with the aid of interdictions

Cited In (6)

• \(\{-1\}\)-self dual finite prechains and applications
• Hereditary hemimorphy of \(\{ 5,-4\}\)-hemimorphic arc connected digraphs.
• On the \(\{4,-k\}\)-hypomorphy for digraphs.
• Properties of non-reconstructible graphs and digraphs
• Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
• Title not available (Why is that?)

This page was built for publication: \((\leq k)\)-hereditarily reconstructible digraphs

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