3 ms·
That's not the same problem. This refers to a grid (not a map) of colored points (not regions), colored with 4 colors (at least in this case) in which a rectan
by nollidge 17y ago
That's not the same problem. This refers to a grid (not a map) of colored points (not regions), colored with 4 colors (at least in this case) in which a rectangle with four same-colored points cannot be found.
- Dove 17y agoNote that the second distinction you made is actually trivial. Coloring the vertices of a planar graph is the same problem as coloring the regions of a different planar graph. The graphs are duals: http://en.wikipedia.org/wiki/Dual_graph http://en.wikipedia.org/wiki/Dual_graph In this case, the dual of a grid is a grid. So at least that part of it would be the same problem. The other distinctions are true, though.
- nollidge 17y agoOf course you are right. I guess I pictured the 17x17=289 points forming 16x16=256 squares, which is why I felt it necessary to make the distinction.