Volume XXVII, April, 1989

Research Article

On the exact minimal (1,4)-cover of twelve points

Sane, Sharad S.

Ars Comb. 27, 3-18 (1989).

Research Article

Construction of some classes of column-regular BTDs, GDDs and 3-PBIBDs with the rectangular association scheme

Vartak, M. N.; Diwanji, S. M.

Ars Comb. 27, 19-39 (1989).

Research Article

Square GBRDs over non-Abelian groups

de Launey, Warwick

Ars Comb. 27, 40-49 (1989).

Research Article

(15,30,14,7,6) dicyclic designs

Wirmani-Prasad, Anjana

Ars Comb. 27, 50-55 (1989).

Research Article

On existence of pandiagonal magic squares

Sun, Rong-guo

Ars Comb. 27, 56-60 (1989).

Research Article

Vertex partitions of graphs into k-stable and k-complete subgraphs

Tuza, Zsolt

Ars Comb. 27, 61-62 (1989).

Research Article

Four mutually orthogonal Latin squares of order 20

Todorov, D. T.

Ars Comb. 27, 63-65 (1989).

Research Article

On a theorem of Hilton

Zhang, Cun-Quan

Ars Comb. 27, 66-86 (1989).

Research Article

Hamilton path tournament designs

Horton, J. D.

Ars Comb. 27, 69-74 (1989).

Research Article

On a PBD generating set problem of Rosa

Mullin, R. C.

Ars Comb. 27, 75-84 (1989).

Research Article

Partial complementation of designs

Rahilly, Alan

Ars Comb. 27, 85-100 (1989).

Research Article

Planar lattices and the slope problem

Czyzowicz, J.

Ars Comb. 27, 101-112 (1989).

Research Article

Order-degree sequences

Bold, Christoph

Ars Comb. 27, 113-116 (1989).

Research Article

On a construction for μ-resolvable designs

Fanning, J. D.

Ars Comb. 27, 117-120 (1989).

Research Article

Orthomorphisms of GF(q)+

Evans, Anthony B.

Ars Comb. 27, 121-132 (1989).

Research Article

Cyclic one-factorization with an invariant one-factor of the complete graph

Korchmáros, Gábor

Ars Comb. 27, 133-138 (1989).

Research Article

Relative difference sets with multiplier 2

Arasu, K. T.; Pott, A.

Ars Comb. 27, 139-142 (1989).

Research Article

More results on the orthogonal Latin square graphs

Fu, Hung-Lin

Ars Comb. 27, 143-148 (1989).

Research Article

On the union-closed sets conjecture

Sarvate, D. G.; Renaud, J.-C.

Ars Comb. 27, 149-154 (1989).

Research Article

The basis numbers of the direct products of paths and cycles

Ali, Ali A.

Ars Comb. 27, 155-164 (1989).

Research Article

Forbidden and unavoidable subgraphs

Gernert, Dieter

Ars Comb. 27, 165-176 (1989).

Research Article

A linear algorithm for breaking periodic Vernam ciphers

Leclerc, Matthias

Ars Comb. 27, 177-180 (1989).

Research Article

Detecting a counterfeit coin with unreliable weighings

Pelc, Andrzej

Ars Comb. 27, 181-192 (1989).

Research Article

A characterization of some finite inversive planes

Key, J. D.; Rostom, N. K. A.

Ars Comb. 27, 193-196 (1989).

Research Article

Some small Kirkman squares

Wallis, W. D.

Ars Comb. 27, 197-200 (1989).

Research Article

Geodetic graphs of diameter two without Petersen subgraphs

Scapellato, Raffaele

Ars Comb. 27, 201-202 (1989).

Research Article

On the circumferences of 2-connected bipartite graphs

Dang, Kai-Qian; Zhao, Lian-Chang

Ars Comb. 27, 203-210 (1989).

Research Article

On association schemes, Schur rings, strongly regular graphs and partial difference sets

Ma, S. L.

Ars Comb. 27, 211-220 (1989).

Research Article

Two short proofs on chromatic polynomials

Lin, Yixun; Zhang, Fuji

Ars Comb. 27, 221-222 (1989).

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;