Volume LII, May, 1999

Research Article

Colouring of distance graphs

Voigt, Margit

Ars Comb. 52, 3-12 (1999).

Research Article

Graph labellings in Boolean lattices

Egawa, Yoshimi; Miyamoto, Masahiko

Ars Comb. 52, 13-19 (1999).

Research Article

Regular subgraphs of hypercubes

Ramras, Mark

Ars Comb. 52, 21-32 (1999).

Research Article

An equation involving the neighborhood (two-step) and line graphs

Miller, Mary M.; Brigham, Robert C.; Dutton, Ronald D.

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

Research Article

New constructions for q-ary covering codes

Östergård, Patric R. J.

Ars Comb. 52, 51-63 (1999).

Research Article

The possible number of cycles in cycle systems

Östergård, Patric R. J.

Ars Comb. 52, 65-70 (1999).

Research Article

A census of minimal pair-coverings with restricted largest block length

Grannell, M. J.; Griggs, T. S.; Quinn, K. A. S.; Stanton, R. G.

Ars Comb. 52, 71-96 (1999).

Research Article

Counting squares of n-subsets in finite groups

Bianchi, Mariagrazia; Gillio, Anna; Verardi, Libero

Ars Comb. 52, 97-114 (1999).

Research Article

Graphs having the local decomposition property

Caro, Yair; Yuster, Raphael

Ars Comb. 52, 115-124 (1999).

Research Article

On partial sums of chromatic polynomials

Dohmen, Klaus

Ars Comb. 52, 125-127 (1999).

Research Article

Domination using induced cliques in graphs

Dunbar, J. E.; Hattingh, J. H.; Laskar, R. C.; Markus, L. R.

Ars Comb. 52, 129-139 (1999).

Research Article

Integral matrices with given row and column sums

Nam, Yunsun

Ars Comb. 52, 141-151 (1999).

Research Article

Steiner systems from binary codes

Key, J. D.; Sullivan, F. E.

Ars Comb. 52, 153-159 (1999).

Research Article

An analysis of the lines in the three dimensional affine space over F3

Macula, Anthony J.

Ars Comb. 52, 161-171 (1999).

Research Article

An optimal algorithm for finding all convex subsets in tournaments

Wolf, Marty J.; Haglin, David J.

Ars Comb. 52, 173-179 (1999).

Research Article

Further results on minimal rankings

Ghoshal, J.; Laskar, R.; Pillone, D.

Ars Comb. 52, 181-198 (1999).

Research Article

On 2-(v,3)Steiner trades of small volumes

Khosrovshahi, G. B.; Maimani, H. R.

Ars Comb. 52, 199-220 (1999).

Research Article

Maximum size of a connected graph with given domination parameters

Arumugam, S.; Velammal, S.

Ars Comb. 52, 221-227 (1999).

Research Article

More Z-cyclic Room squares

Liaw, Y. S.

Ars Comb. 52, 228-238 (1999).

Research Article

Connectivity of cycle matroids and bicircular matroids

Chen, Zhi-Hong; Kuang, Ying-Qiang; Lai, Hong-Jian

Ars Comb. 52, 239-250 (1999).

Research Article

An isomorphic decomposition of K24

Chen, Zhi-Hong; Kuang, Ying-Qiang; Lai, Hong-Jian

Ars Comb. 52, 251-252 (1999).

Research Article

Some new characterizations of matroids

Mishra, S.

Ars Comb. 52, 253-258 (1999).

Research Article

Stability, domination, and irredundance in WAR graphs

Puech, Joël

Ars Comb. 52, 259-271 (1999).

Research Article

Polychrome labelings of trees and cycles

Valentin, Katja

Ars Comb. 52, 272-284 (1999).

Research Article

A generalization of maximal k-multiple-free sets of integers

Liu, Bolian; Bo, Zhou

Ars Comb. 52, 285-288 (1999).

Research Article

Difference matrices and orthomorphisms over non-abelian groups

Quinn, Kathleen A. S.

Ars Comb. 52, 289-295 (1999).

Research Article

Refining the graph density condition for the existence of almost K-factors

Alon, Noga; Fischer, Eldar

Ars Comb. 52, 296-308 (1999).

Research Article

The smallest covering code of length 8 and radius 2 has 12 words

Blass, Uri; Litsyn, Simon

Ars Comb. 52, 309-318 (1999).

E-mail Alert

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

Call for papers

Special issue: Proceedings of International Conference on Discrete Mathematics (ICDM 2025)

Guest editors: Peter J Cameron, Ambat Vijayakumar, Aparna Lakshmanan S

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.