Recommendations
Cited in
(8)- On tiling under tomographic constraints.
- Discrete tomography determination of bounded sets in \(\mathbb{Z}^n\)
- Stability of Kronecker coefficients via discrete tomography
- Path puzzles: discrete tomography with a path constraint is hard
- Tomography on Finite Graphs
- Extremal theorems for degree sequence packing and the two-color discrete tomography problem
- A note on packing of graphic \(n\)-tuples
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
This page was built for publication: Discrete tomography and plane partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940423)