A simpler counterexample to the reconstruction conjecture for denumerable graphs (Q2550035): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A counterexample to the countable version of a conjecture of Ulam / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5544087 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5572939 / rank | |||
Normal rank | |||
Latest revision as of 10:35, 12 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simpler counterexample to the reconstruction conjecture for denumerable graphs |
scientific article |
Statements
A simpler counterexample to the reconstruction conjecture for denumerable graphs (English)
0 references
1972
0 references
