A simpler counterexample to the reconstruction conjecture for denumerable graphs (Q2550035): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0095-8956(72)90026-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2093646058 / rank | |||
Normal rank | |||
| 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 09: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
