Nearly acyclic graphs are reconstructible (Q4159408): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/jgt.3190020105 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2042813868 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A congruence theorem for trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reconstruction of Trees / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reconstructing colored graphs / rank | |||
Normal rank | |||
Latest revision as of 22:35, 12 June 2024
scientific article; zbMATH DE number 3590315
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Nearly acyclic graphs are reconstructible |
scientific article; zbMATH DE number 3590315 |
Statements
Nearly acyclic graphs are reconstructible (English)
0 references
1978
0 references
