|
|
A223498
|
|
Petersen graph (3,1) coloring a rectangular array: number of n X n 0..5 arrays where 0..5 label nodes of a graph with edges 0,1 0,3 3,5 3,4 1,2 1,4 4,5 2,0 2,5 and every array movement to a horizontal, diagonal or antidiagonal neighbor moves along an edge of this graph, with the array starting at 0.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
EXAMPLE
|
Some solutions for n=3
..0..3..0....0..2..5....0..3..0....0..2..1....0..1..0....0..1..0....0..2..0
..0..2..0....0..3..0....4..1..4....0..2..1....4..1..4....2..1..0....5..3..0
..0..2..5....0..3..0....2..5..2....0..2..5....4..3..4....0..1..0....0..3..5
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|