Pages that link to "Item:Q1120274"
From MaRDI portal
The following pages link to Unit-length embedding of binary trees on a square grid (Q1120274):
Displaying 12 items.
- Complexity dichotomy on partial grid recognition (Q533881) (← links)
- The logic engine and the realization problem for nearest neighbor graphs (Q1349880) (← links)
- Expansion of layouts of complete binary trees into grids (Q1414240) (← links)
- The realization problem for Euclidean minimum spanning trees is NP-hard (Q1920421) (← links)
- Complexity dichotomy on degree-constrained VLSI layouts with unit-length edges (Q2883585) (← links)
- A decomposition for total-coloring partial-grids and list-total-coloring outerplanar graphs (Q3008921) (← links)
- (Q3305360) (← links)
- On Upward Drawings of Trees on a Given Grid (Q4625120) (← links)
- Nearest neighbour graph realizability is NP-hard (Q5096336) (← links)
- How to fit a tree in a box (Q5925577) (← links)
- (Q6065396) (← links)
- Grid recognition: classical and parameterized computational perspectives (Q6156159) (← links)
