Edge-2-coloring in case of triangulations of the sphere according to J. Petersen
Proksch, Ruth
Util. Math. 52, 3-28 (1997).
Optimal designs with a single two-level factor and n autocorrelated observations
Angelis, L.; Bora-Senta, E.; Moyssiadis, C.
Util. Math. 52, 29-42 (1997).
Upper bounds on linear vertex-arboricity of complementary graphs
Alavi, Yousef; Erdős, Paul; Lam, Peter Che Bor; Lick, Don; Liu, Jiuqiang; Wang, Jianfang
Util. Math. 52, 43-48 (1997).
Equireplicate balanced block designs with nested rows and columns with at most two unequal block sizes
Uddin, Nizam; Chen, Q.; Patil, S. A.
Util. Math. 52, 49-64 (1997).
The Ramsey number r(K1,3,C4,K4)
Klamroth, Kathrin; Mengersen, Ingrid
Util. Math. 52, 65-81 (1997).
A non monotone waiting time queueing model
Hlynka, M.; Drekic, S.; McPhail, G.
Util. Math. 52, 83-89 (1997).
A method of constructing 3-designs
Raghavarao, Damarju; Zhou, Bei
Util. Math. 52, 91-96 (1997).
On the coefficient of λ in the characteristic polynomial of singular graphs
Sciriha, Irene
Util. Math. 52, 97-111 (1997).
On almost D-optimal first order saturated designs and their efficiency
Koukouvinos, Christos
Util. Math. 52, 113-121 (1997).
New general analytic and numerical methods in constrained optimization with applications to optimal consumption
Banerjee, Dean; Gregory, John
Util. Math. 52, 123-128 (1997).
A criterion for cyclic whist tournaments with the three person property
Finizio, Norman J.; Lewis, James T.
Util. Math. 52, 129-140 (1997).
Binary bent sequences of order 64
Chang, Derek K.
Util. Math. 52, 141-151 (1997).
Disjoint difference families with block size 3
Dinitz, J. H.; Rodney, P.
Util. Math. 52, 153-160 (1997).
Pairs of maximal “almost” disjoint isomorphic subgraphs of spiders
Brigham, Robert C.; Dutton, Ronald D.
Util. Math. 52, 161-172 (1997).
Avoiding arithmetic progressions (modm) and arithmetic progressions
Landman, Bruce M.
Util. Math. 52, 173-182 (1997).
A construction of combinatorial arrays from non-linear functions
Fuji-Hara, Ryoh; Miyamoto, Nobuko
Util. Math. 52, 183-192 (1997).
The maximum number of trades of volume four in a symmetric design
Gray, Brenton D.
Util. Math. 52, 193-203 (1997).
An algorithm for completing partials, with an application to the smallest defining sets of the STS(15)
Ramsay, Colin
Util. Math. 52, 205-221 (1997).
Multiple minimum coverings of Kn with copies of K4−e
Lindner, C. C.; Street, Anne Penfold
Util. Math. 52, 223-239 (1997).
Isomorphism classes of supersingular elliptic curves of characteristic ≥3. (Classes d’isomorphismes des courbes elliptiques supersingulières en caractéristique ≥3.)
Morain, F.
Util. Math. 52, 241-253 (1997).
