31 search results - page 1 / 7 » A Radio Coloring of a Hypercube |
IJCM
2002
13 years 4 months ago
2002
A radio coloring of a graph G is an assignment of nonnegative integers to its nodes so that each pair of adjacent nodes have color numbers that differ by at least two, and any pai...
SIAMDM
2008
13 years 4 months ago
2008
Alon, Krech, and Szab
JGT
2006
13 years 4 months ago
2006
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answer...
IPL
2002
13 years 4 months ago
2002
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices wh...
ICPP
2003
IEEE
13 years 10 months ago
2003
IEEE
