|
|
A223394
|
|
4X4 square grid graph coloring a rectangular array: number of n X n 0..15 arrays where 0..15 label nodes of the square grid graph and every array movement to a horizontal or vertical neighbor moves along an edge of this graph
|
|
1
|
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..2..6..7....7..6.10....2..3..7....5..6..2....7.11.15...11.10.14...11..7..6
..6.10..6...11.10.11....6..7.11....6..5..6...11.10.11...10..9.10....7..3..7
.10..6.10...15.11.10....5..6..7....5..9..5...10.11.10....6.10.11....3..7..6
Vertex neighbors:
0 -> 1 4
1 -> 0 2 5
2 -> 1 3 6
3 -> 2 7
4 -> 0 5 8
5 -> 4 1 6 9
6 -> 5 2 7 10
7 -> 6 3 11
8 -> 4 9 12
9 -> 8 5 10 13
10 -> 9 6 11 14
11 -> 10 7 15
12 -> 8 13
13 -> 12 9 14
14 -> 13 10 15
15 -> 14 11
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|