Perfect colorings of the infinite square grid: coverings and twin colors
From MaRDI portal
Publication:2699652
DOI10.37236/10005OpenAlexW4364391994MaRDI QIDQ2699652
Publication date: 19 April 2023
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.15839
Combinatorial aspects of block designs (05B05) Other designs, configurations (05B30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On perfect 2-colorings of the \(q\)-ary \(n\)-cube
- On the binary codes with parameters of triply-shortened 1-perfect codes
- On periodicity of perfect colorings of the infinite hexagonal and triangular grids
- Intriguing sets of vertices of regular graphs
- Theory of codes with maximum rank distance
- Orthogonal arrays. Theory and applications
- On multiple coverings of the infinite rectangular grid with balls of constant radius
- Tactical decompositions and orbits of projective groups
- Graphical designs and extremal combinatorics
- Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs
- On perfect colorings of infinite multipath graphs
- On the \(\mathrm{OA}(1536,13,2,7)\) and related orthogonal arrays
- Completely regular codes in the infinite hexagonal grid
- A bound on correlation immunity
- A Census of Small Latin Hypercubes
- On completely regular codes
This page was built for publication: Perfect colorings of the infinite square grid: coverings and twin colors