New bounds on a hypercube coloring problem

Information Processing Letters

Volumn 84, Issue 5, 2002, Pages 265-269

  Ngo, Hung Quang ^a   Du, Ding Zhu ^b   Graham, Ronald L ^c  

^a the State University of New York   (United States)

^b University of Minnesota   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Coloring; Combinatorial problems; n cube

Indexed keywords

COLOR; FIBER OPTIC NETWORKS; PROBLEM SOLVING; VECTORS;

HYPERCUBE COLORING PROBLEMS;

GRAPH THEORY;

EID: 0037121488     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00301-0     Document Type: Article

References (4)

1. Kim D.S., Du D.-Z., Pardalos P.M. A coloring problem on the n -cube. Discrete Appl. Math. 103:2000;307-311.
2. Pavan A., Wan P.-J., Tong S.-R., Du D.H. A new multihop lightwave network based on the generalized de-Bruijn graph. Proc. on IEEE INFOCOM. 1996;498-507.
3. Roman S. Coding and Information Theory. 1992;253-263 Springer, New York.
4. Wan P.-J. Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. J. Combin. Optimization. 1:1997;179-186.