Question 102
In a hexagonal grid with unit side lengths, vertices are connected by paths of unit length. Two vertices are considered adjacent if they are connected directly by such a path.
Determine the minimum number of cities that can be placed on the vertices such that no two cities are placed on adjacent vertices, and no more cities can be added without violating this condition.
(Orgil-Erdene Erdenebaatar)
Determine the minimum number of cities that can be placed on the vertices such that no two cities are placed on adjacent vertices, and no more cities can be added without violating this condition.
(Orgil-Erdene Erdenebaatar)