Maximal 2-dimensional binary words of bounded degree
From MaRDI portal
Cites work
- Combinatorics on Words
- Degree-Constrained Subgraph Problems: Hardness and Approximation Results
- HV-Palindromes in Two-Dimensional Words
- Multidimensional unrepetitive configurations
- Nivat's conjecture holds for sums of two periodic configurations
- Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
- On a conjecture on bidimensional words.
- The domination number of grids
- The rectangle complexity of functions on two-dimensional lattices
- Two-dimensional languages
This page was built for publication: Maximal 2-dimensional binary words of bounded degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899376)