Strictly Chordality-k graphs (SC k graphs) are graphs which are either cycle free or every induced cycle is exactly k, for some fixed k, k ≥ 3. Note that k = 3 and k = 4 are precisely the Chordal graphs and Chordal Bipartite graphs, respectively. In this paper, we initiate a structural and an algo-rithmic study of SC k , k ≥ 5 graphs.

The parallel numerical solution of the Navier-Stokes equations with the sparse grid combination method was studied. This algo-rithmic concept is based on the independent solution of many problems with reduced size and their linear combination. The algorithm for 3-dimensional problems is described. Its parallel implementation on an IBM SP2 and a cluster of 16 HP workstations is discussed.