A reconstrability conjecture for graphs with restrictions for 4-vertex simple paths (Q3115189)
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: A reconstrability conjecture for graphs with restrictions for 4-vertex simple paths |
scientific article; zbMATH DE number 6007830
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A reconstrability conjecture for graphs with restrictions for 4-vertex simple paths |
scientific article; zbMATH DE number 6007830 |
Statements
20 February 2012
0 references
reconstruction conjecture
0 references
disconnected graph
0 references
tidy graph
0 references
reducible graph
0 references
1-decomposable graph
0 references
0.8308815956115723
0 references
0.8126778602600098
0 references
0.808995246887207
0 references
0.808995246887207
0 references
