Maximal 2-dimensional binary words of bounded degree

DOI10.1007/978-3-031-97548-6_4MaRDI QIDQ6899376zbMATH OpenFDO

Authors Alexandre Blondin Massé, Alain Goupil, Raphael L' Heureux, Louis Marin

Publication date 14 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-97548-6_4

Mathematics Subject Classification ID

Combinatorics on words (68R15)

Cites work

• Combinatorics on Words
• Degree-Constrained Subgraph Problems: Hardness and Approximation Results
• scientific article; zbMATH DE number 2150293 (Why is no real title available?)
• 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

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)