Pages that link to "Item:Q1962070"
From MaRDI portal
The following pages link to The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees (Q1962070):
Displaying 5 items.
- Determining the consistency of partial tree descriptions (Q1028903) (← links)
- Convex tree realizations of partitions (Q1195647) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- THE REDUCTS OF THE HOMOGENEOUS BINARY BRANCHING <i>C</i>-RELATION (Q2976332) (← links)
- Solving infinite-domain CSPs using the patchwork property (Q6157211) (← links)