Volume XXIXC, August, 1990

Research Article

Intersection polynomials for t-designs in Delsarte spaces

Hoggar, S. G.

Ars Comb. 29C, 5-12 (1990).

Research Article

On the Steiner radius and Steiner diameter of a graph

Henning, Michael A.

Ars Comb. 29C, 13-19 (1990).

Research Article

A class of minimal {0,2}-graphs: “Generalized Shrikhande graphs”

Madani, R. M.

Ars Comb. 29C, 21-26 (1990).

Research Article

Further combinatorial investigations of balanced arrays

Chopra, D. V.

Ars Comb. 29C, 27-32 (1990).

Research Article

Construction of three-dimensional perfect matrices

Iványi, A. M.

Ars Comb. 29C, 33-40 (1990).

Research Article

On the primitivity of a nonnegative matrix with many entries

Lewin, Mordechai

Ars Comb. 29C, 41-47 (1990).

Research Article

On the k-domination and k-transversal numbers of graphs and hypergraphs

Caro, Yair

Ars Comb. 29C, 49-55 (1990).

Research Article

Mixed Ramsey numbers and irredundant Turán numbers for graphs

Cockayne, E. J.; Hattingh, J. H.; Kok, J.; Mynhardt, C. M.

Ars Comb. 29C, 57-68 (1990).

Research Article

Greedesigns

Hartman, Alan; Yehudai, Zvi

Ars Comb. 29C, 69-76 (1990).

Research Article

Hamiltonism and claws

Flandrin, E.; Li, H.

Ars Comb. 29C, 77-89 (1990).

Research Article

Some results on conjectures of graffiti. I

Favaron, O.; Mahéo, M.; Saclé, J.-F.

Ars Comb. 29C, 90-106 (1990).

Research Article

Edge-reconstruction and k-free graphs

Sheehan, J.; Clapham, C. R. J.

Ars Comb. 29C, 107-109 (1990).

Research Article

Remarks on Hamiltonian properties of claw-free graphs

Ainouche, A.; Broersma, H. J.; Veldman, H. J.

Ars Comb. 29C, 110-121 (1990).

Research Article

Matchings and coverings in regular uniform hypergraphs

Tuza, Zsolt

Ars Comb. 29C, 122-129 (1990).

Research Article

Strong cycle covers

Kang, Dingsong; Hoede, Cornelis; Vestergaard, Preben Dahl

Ars Comb. 29C, 130-139 (1990).

Research Article

Shadows, density and partitions

Lefmann, Hanno

Ars Comb. 29C, 140-156 (1990).

Research Article

Coverings of infinite graphs

Jørgensen, Leif K.

Ars Comb. 29C, 157-159 (1990).

Research Article

Irregular weighting of a finite projective plane

Lehel, Jenö; Szönyi, Tamás

Ars Comb. 29C, 160-167 (1990).

Research Article

First fit and on-line chromatic number of families of graphs

Gyárfás, András; Lehel, Jenö

Ars Comb. 29C, 168-176 (1990).

Research Article

A representation of maximal (k,r)-sets of PG(3n-1,q)

Casse, L. R. A.; O’Keefe, Christine M.; Wild, P. R.

Ars Comb. 29C, 177-182 (1990).

Research Article

On ω-divisors of a graph

Mitchell, Jane M. O.

Ars Comb. 29C, 183-188 (1990).

Research Article

On the irredundant Ramsey number s(3,3,3)

Cockayne, E. J.; Mynhardt, C. M.

Ars Comb. 29C, 189-202 (1990).

Research Article

Nonregular graphs of optimal reliability

Smith, D. H.

Ars Comb. 29C, 203-206 (1990).

Research Article

A generalization of Mendelsohn triple systems

Kang, Qingde

Ars Comb. 29C, 207-215 (1990).

Research Article

Computing chromatic polynomials

Anthony, Martin H. G.

Ars Comb. 29C, 216-220 (1990).

Research Article

On the index of certain outerplanar graphs

Rowlinson, Peter

Ars Comb. 29C, 221-225 (1990).

Research Article

Solutions to xr=α in the alternating group

Chernoff, W. W.

Ars Comb. 29C, 226-227 (1990).

Research Article

Antipodal coverings of complete graphs

Gardiner, A.

Ars Comb. 29C, 228-233 (1990).

E-mail Alert

Add your e-mail address to receive upcoming issues of Ars Combinatoria.

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;