Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (Q2175784): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1904.11901 / rank | |||
Normal rank | |||
Revision as of 01:56, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices |
scientific article |
Statements
Degree lists and connectedness are 3-reconstructible for graphs with at least seven vertices (English)
0 references
30 April 2020
0 references
graph reconstruction
0 references
deck
0 references
reconstructibility
0 references
connected
0 references
