All graphs are set reconstructible if all 2-connected graphs are set reconstructible. (Q3624980)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: All graphs are set reconstructible if all 2-connected graphs are set reconstructible. |
scientific article; zbMATH DE number 5551601
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | All graphs are set reconstructible if all 2-connected graphs are set reconstructible. |
scientific article; zbMATH DE number 5551601 |
Statements
6 May 2009
0 references
graph reconstruction
0 references
set reconstruction
0 references
Ulam's conjecture
0 references
0.8145789504051208
0 references
0.8080152869224548
0 references
0.8029940128326416
0 references
0.7984588742256165
0 references
