Volume LIV, December, 1999

Research Article

Bipartite graphs and absolute difference tolerances

Brigham, Robert C.; Carrington, Julie R.; Vitray, Richard P.

Ars Comb. 54, 3-27 (1999).

Research Article

On the group of line crossings on the \(2-D\) torus

Chou, Wun-Seng; Shiue, Peter Jau-Shyong

Ars Comb. 54, 29-31 (1999).

Research Article

existence of group divisible designs with first and second associates, having block size \(3\)

Fu, H. L.; Rodger, C. A.; Sarvate, D. G.

Ars Comb. 54, 33-50 (1999).

Research Article

of cyclic abelian covers of symmetric digraphs

Mizuno, Hirobumi; Sato, Iwao

Ars Comb. 54, 51-64 (1999).

Research Article

k-equitable labelings of complete bipartite and multipartite graphs

Vickrey, David

Ars Comb. 54, 65-85 (1999).

Research Article

Another Doyen-Wilson theorem

Hoffman, D. G.; Kirkpatrick, K. S.

Ars Comb. 54, 87-96 (1999).

Research Article

orthogonal designs and sequences with two and three variables in order \(28\)

Koukouvinos, Christos; Seberry, Jennifer

Ars Comb. 54, 97-108 (1999).

Research Article

A large collection of designs from a wreath product on \(21\) points

Acketa, Dragan M.; Mudrinski, Vojislav; Matić-Kekić, Snežana

Ars Comb. 54, 109-118 (1999).

Research Article

\(E3\)-cordial graphs

Cahit, I.; Yilmaz, R.

Ars Comb. 54, 119-127 (1999).

Research Article

Bounds on the total redundance and efficiency of a graph

Goddard, Wayne; Oellermann, Ortrud R.; Slater, Peter J.; Swart, Henda C.

Ars Comb. 54, 129-138 (1999).

Research Article

A note on joint distributions of some random vectors defined on permutations

Chen, Yi-Liang; Cheng, Wei-Hou

Ars Comb. 54, 139-148 (1999).

Research Article

Total svertex enumeration in rooted planar maps

Koganov, Leonid M.; Liskovets, Valery A.; Walsh, Timothy R. S.

Ars Comb. 54, 149-160 (1999).

Research Article

Counting nilpotent pairs in finite groups

Fulman, Jason E.; Galloy, Michael D.; Sherman, Gary J.; Vanderkam, Jeffrey M.

Ars Comb. 54, 161-178 (1999).

Research Article

Bicyclic antiautomorphisms of Mendelsohn triple systems with 0 or 1 fixed points

Carnes, Neil P.; Dye, Anne; Reed, James F.

Ars Comb. 54, 179-186 (1999).

Research Article

The linear 3-cover of the Hermitean forms graph on 81 vertices

Schade, Tilla

Ars Comb. 54, 187-222 (1999).

Research Article

On the general Randić index for certain families of trees

Clark, L. H.; Moon, J. W.

Ars Comb. 54, 223-235 (1999).

Research Article

Loops with partitions and matchings

Lehel, Jenő; Levi, Inessa

Ars Comb. 54, 237-253 (1999).

Research Article

New and old values for maximal \(MOLS(n)\)

Bedford, David; Whitaker, Roger M.

Ars Comb. 54, 255-258 (1999).

Research Article

Integral sum numbers of graphs

Liaw, Sheng-Chyang; Kuo, David; Chang, Gerard J.

Ars Comb. 54, 259-268 (1999).

Research Article

Decompositions and packings of digraphs with orientations of a 4-cycle

Gardner, Robert B.; Huff, Coleen; Kennedy, Janie

Ars Comb. 54, 269-282 (1999).

Research Article

Gracefulness of the union of cycles and paths

Seoud, M. A.; Abd el Maqsoud, A. E. I.; Sheehan, J.

Ars Comb. 54, 283-292 (1999).

Research Article

\(G\)-reconstruction of graphs

Thatte, Bhalchandra D.

Ars Comb. 54, 293-299 (1999).

Research Article

Spreads and resolutions of Ree unitals

Dover, Jeremy

Ars Comb. 54, 301-309 (1999).

Research Article

Connected \((g,f)\)-factors and supereulerian digraphs

Gutin, G.

Ars Comb. 54, 311-317 (1999).

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;