Completely regular codes in the infinite hexagonal grid

DOI10.17377/semi.2016.13.079zbMath1369.05061arXiv1612.01360OpenAlexW2560252601MaRDI QIDQ2402205

A. Yu. Vasil'eva, Denis S. Krotov, Sergei V. Avgustinovich

Publication date: 6 September 2017

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1612.01360

zbMATH Keywords

partition designcompletely regular codeequitable partitionhexagonal gridperfect coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Applications of graph theory to circuits and networks (94C15) Theory of error-correcting codes and error-detecting codes (94B99)

Related Items

The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances ⋮ Perfect colorings of the infinite square grid: coverings and twin colors ⋮ On completely regular codes ⋮ On perfect colorings of paths divisible by a matching

This page was built for publication: Completely regular codes in the infinite hexagonal grid