Coloring of the dth power of the face-centered cubic grid

06/21/2018
by   Nicolas Gastineau, et al.
0

The face-centered cubic grid is a three dimensional 12-regular infinite grid. This graph represents an optimal way to pack spheres in the three-dimensional space. In this grid, the vertices represent the spheres and the edges represent the contact between spheres. We give lower and upper bounds on the chromatic number of the d th power of the face-centered cubic grid. In particular, in the case d = 2 we prove that the chromatic number of this grid is 13. We also determine sharper bounds for d = 3 and for subgraphs of of the face-centered cubic grid.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/19/2020

Leader Election And Local Identifiers For 3D Programmable Matter

In this paper, we present two deterministic leader election algorithms f...
research
08/05/2019

Atomistic and mean-field estimates of effective stiffness tensor of nanocrystalline materials of cubic symmetry

Anisotropic core-shell model of a nano-grained polycrystal, proposed rec...
research
03/12/2018

Counting of Shortest Paths in Cubic Grid

The enumeration of shortest paths in cubic grid is presented here. The c...
research
07/23/2022

A p-centered coloring for the grid using O(p) colors

A p-centered coloring of a graph G, where p is a positive integer, is a ...
research
09/14/2022

Optimal L(1,2)-edge Labeling of Infinite Octagonal Grid

For two given non-negative integers h and k, an L(h,k)-edge labeling of ...
research
01/03/2020

Upper bounds for stabbing simplices by a line

It is known that for every dimension d> 2 and every k<d there exists a c...
research
11/30/2021

Search by a Metamorphic Robotic System in a Finite 3D Cubic Grid

We consider search in a finite 3D cubic grid by a metamorphic robotic sy...

Please sign up or login with your details

Forgot password? Click here to reset