scientific article; zbMATH DE number 7530707
From MaRDI portal
Publication:5078313
zbMath1486.05116MaRDI QIDQ5078313
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/
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
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
- Prechains and self duality
- The (\(\leqslant k\))-half-reconstructibility of graphs for \(k\in \{11,12\}\)
- Strongly self-complementary and hereditarily isomorphic tournaments
- 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
- Caracterisation des classes de (≤ 3)-hypomorphie a l'aide d'interdits
- L'Indeformabilite des Relations et Multirelations Binaires
- 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
- La relation différence et l'anti‐isomorphie
- Procédé de construction des relations binaires non (≤ 3)-reconstructibles
- Transitiv orientierbare Graphen
- Modules of Coherent Binary Systems
This page was built for publication:
