### Table 1: Computing II for cyclic dependence graph

### Table 1: Statistics for flower cyclic CSG-graph

1996

Cited by 1

### Table 2: Statistics for improved flower cyclic CSG-graph

1996

Cited by 1

### Table 2: Statistics for improved flower cyclic CSG-graph

### Table 1 Compactly cyclically colorable graphs and their 0 cc(G) as compared to 0 c(G).

"... In PAGE 14: ... This contradicts (9) and (10). 2 5 Concluding remarks Table1 gathers families of cyclically colorable graphs for which either exact value or estimates on 0 cc were established. For classic compact edge-coloring model there are known families of graphs for which the di erence between the minimum number of colors and (G) is arbitrary large [5].... ..."

### Table I. New lower bounds and corresponding cyclic Ramsey graphs. Ramsey New

1996

Cited by 5

### Table I. New lower bounds and corresponding cyclic Ramsey graphs. Ramsey New

1996

Cited by 5

### Table 4. Data for Cayley graphs of semidirect products of cyclic groups.

"... In PAGE 7: ... The groups are all semidirect products of two cyclic groups Zm o Zn. In Table4 , the triple (m; n; k) indicates that the homomorphism from Zn into Z m = Aut(Zm) is determined by the requirement that it map the generator 1 of Zn to an element k 2 Z m such that kn = 1. The ordered pairs represent the generators of the Cayley graph in the usual way as elements of the set Zm Zn.... ..."

### Table 4. Data for Cayley graphs of semidirect products of cyclic groups.

"... In PAGE 8: ... The groups are all semidirect products of two cyclic groups Z m oZ n . In Table4 , the triple n28m; n; kn29 indicates that the homomorphism from Z n into Z n03 m n18 = Autn28Z m n29is determined by the requirement that it map the generator 1 of Z n to an element k 2 Z n03 m such that k n =1. The ordered pairs represent the n01 generators of the Cayley graph in the usual way as elements of the set Z m n02 Z n .... ..."