Colouring-In

**Obsidantion** · October 19th 2008, 03:47 PM

Colour (or label) a 3x3 square grid with three colours so that every square (1x1) is neighboured at least once by both of the remaining colours which aren't contained within that square.

**Soroban** · October 19th 2008, 08:41 PM

Hello, Obsidantion!

Colour (or label) a 3x3 square grid with three colours
so that every 1x1 square is neighboured at least once by both of the
remaining colours which aren't contained within that square.

If I understand the problem, this is a solution.

. . $\begin{array}{|c|c|c|}\hline<br /> <br /> {\color{red}\blacksquare} & {\color{green}\blacksquare} & {\color{red}\blacksquare} \\ \hline {\color{blue}\blacksquare} & {\color{blue}\blacksquare} & {\color{blue}\blacksquare} \\ \hline {\color{green}\blacksquare} & {\color{red}\blacksquare} & {\color{green}\blacksquare} \\ \hline \end{array}$

**Obsidantion** · October 20th 2008, 05:29 AM

Originally Posted by Soroban

Hello, Obsidantion!

If I understand the problem, this is a solution.

. . $\begin{array}{|c|c|c|}\hline<br /> <br /> {\color{red}\blacksquare} & {\color{green}\blacksquare} & {\color{red}\blacksquare} \\ \hline {\color{blue}\blacksquare} & {\color{blue}\blacksquare} & {\color{blue}\blacksquare} \\ \hline {\color{green}\blacksquare} & {\color{red}\blacksquare} & {\color{green}\blacksquare} \\ \hline \end{array}$

Congrats mate.

Thread: Colouring-In

LinkBack

Thread Tools

Display

Colouring-In

Similar Math Help Forum Discussions

Edge colouring in K_n

[SOLVED] graph vertex colouring

Graph theory - colouring

colouring vertices in graph theory

Road Colouring Problem - Solved

Search Tags