Perfect colorings of the infinite circulant graph with distances 1 and 2
From MaRDI portal
Publication:5374001
DOI10.1134/S1990478917030097zbMath1399.05079OpenAlexW2752958469MaRDI QIDQ5374001
Mariya Aleksandrovna Lisitsyna, Olga G. Parshina
Publication date: 6 April 2018
Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s1990478917030097
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)
Related Items
The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances ⋮ On perfect colorings of infinite multipath graphs ⋮ \(S\)-packing colorings of distance graphs \(G ( \mathbb{Z} , \{ 2 , t \} )\) ⋮ New perfect colorings of infinite circulant graphs with continuous sets of distanses
Cites Work
- On multiple coverings of the infinite rectangular grid with balls of constant radius
- Perfect colorings of the prism graph
- On periodicity of two-dimensional words
- Perfect 3-colorings of prism and Möbius ladder graphs
- Perfect 2-colorings of infinite circulant graphs with continuous set of distances
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Perfect colorings of the infinite circulant graph with distances 1 and 2
