Pages that link to "Item:Q3483309"
From MaRDI portal
The following pages link to The ally-reconstruction number of a tree with five or more vertices is three (Q3483309):
Displayed 7 items.
- Degree-associated reconstruction number of graphs (Q709303) (← links)
- Complexity results in graph reconstruction (Q867853) (← links)
- The centroidal branches of a separable graph are edge reconstructible (Q1377714) (← links)
- A multi-stage hierarchical clustering algorithm based on centroid of tree and cut edge constraint (Q2127074) (← links)
- Families of pairs of graphs with a large number of common cards (Q3553230) (← links)
- Reconstructing trees from two cards (Q5189235) (← links)
- Adversary degree associated reconstruction number of graphs (Q5245852) (← links)