The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances
From MaRDI portal
Publication:2182237
DOI10.33048/semi.2020.17.038zbMath1440.05095arXiv1903.09444OpenAlexW3098502360MaRDI QIDQ2182237
Mariya Aleksandrovna Lisitsyna, Olga G. Parshina
Publication date: 21 May 2020
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.09444
Enumeration in graph theory (05C30) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)
Related Items
On perfect colorings of infinite multipath graphs ⋮ New perfect colorings of infinite circulant graphs with continuous sets of distanses ⋮ On a metric property of perfect colorings ⋮ On perfect colorings of paths divisible by a matching
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On periodicity of perfect colorings of the infinite hexagonal and triangular grids
- On multiple coverings of the infinite rectangular grid with balls of constant radius
- On unbalanced Boolean functions with best correlation immunity
- Completely regular codes in the infinite hexagonal grid
- Perfect colorings of the prism graph
- Perfect colorings of radius \(r>1\) of the infinite rectangular grid
- A bound on correlation immunity
- Perfect colorings of the 12-cube that attain the bound on correlation immunity
- Completely regular designs
- On Perfect 2‐Colorings of Johnson Graphs J(v, 3)
- Perfect colorings of the infinite circulant graph with distances 1 and 2
This page was built for publication: The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances
