206
span, 113
of fan,
18
of a coloring,
67
of a set,
67
of an interval coloring, 113
spider,
150
star, 3,
40
storage allocation problem in warehouse,
65
strength,
56, 57
sum coloring,
55, 61, 62, 64
sum multicoloring,
63
sum multicoloring problem,
55
susceptibility,
28
symmetric cycles,
147
symmetric line,
146
symmetric trees,
148
T-coloring,
70
e-optimal,
72
optimal, 72
T-graph,
73
T-saturation degree,
77
T-span,
71
The Pigeonhole Principle,
164
theorem
Brook's,
57
three dimensional matching problem, 59
torus, 112 ·
Total Coloring Conjecture,
51
tree,
58, 61, 63
complete binary,
40
elimination,
81
oriented,
151
triangle-free polygon,
41
treewidth,
60
triangulation,
177, 180
even,
187
union of graphs,
43
vertex
chromatic sum, see also chromatic sum
k-coloring
k-coloring, see also k-coloring
multicoloring,
63
universal,
51
vertex £-coloring, see also £-coloring
vertex-coloring
equitable,
36
vertices
adjacent, 1
nonadjacent, 1
Vizing, 117
VLSI design,
55, 63-65
Wavelength Division Multiplexing (WDM),
32
wheel, 3
broken spoke,
48, 126
INDEX
multiaxle,
131
Wn, 61
Previous Page Next Page