Are all pairs of hypomorphic digraphs \(S\)-isomorphic? (Q2161275): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / DOI | |||
Property / DOI: 10.1016/j.dam.2021.08.003 / rank | |||
Property / cites work | |||
Property / cites work: On nonreconstructable tournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2829077 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph reconstruction—a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3816105 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5572939 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the problem of reconstructing a tournament from subtournaments / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hypomorphisms, orbits, and reconstruction / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: N-reconstructibility of non-reconstructible digraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4085743 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Erratum to: “The falsity of the reconstruction conjecture for tournaments” / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A census of non-reconstructable digraphs. I: Six related families / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3824450 / rank | |||
Normal rank | |||
Property / DOI | |||
Property / DOI: 10.1016/J.DAM.2021.08.003 / rank | |||
Normal rank |
Latest revision as of 08:27, 17 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Are all pairs of hypomorphic digraphs \(S\)-isomorphic? |
scientific article |
Statements
Are all pairs of hypomorphic digraphs \(S\)-isomorphic? (English)
0 references
4 August 2022
0 references
hypomorph
0 references
pasting of two cards
0 references
non-reconstructible digraph pairs
0 references
\(S\)-isomorphic digraphs
0 references