Volume LII, May, 1999
Margit Voigt "Colouring of distance graphs"
Yoshimi Egawa and Masahiko Miyamoto "Graph Labelings in Boolean Lattices"
Mark Ramras "Regular Subgraphs of Hypercubes"
Mary M. Miller, Robert C. Brigham and Ronald D. Dutton "An Equation Involving the Neighborhood (Two-Step) and Line Graphs"
Patric R.J. Ostergard "New Constructions for q-ary Covering Codes"
Elizabeth J. Billington and Darryn E. Bryant "The possible number of cycles in cycle systems"
M.J. Grannell, T.S. Griggs, K.A.S. Quinn and R.G. Stanton "A census of minimum pair-coverings with restricted largest block length"
Mariagrazia Bianchi, Anna Gillio and Libero Verardi "Counting Squares of n-Subsets in Finite Groups"
Yair Caro and Raphael Yuster "Graphs Having the Local Decomposition Property"
Klaus Dohmen "On Partial Sums of Chromatic Polynomials"
J.E. Dunbar, J.H. Hattingh, R.C. Laskar and L.R. Markus "Domination Using Induced Cliques in Graphs"
Yunsun Nam "Integral Matrices with Given Row and Column Sums "
J.D. Key and F.E. Sullivan "Steiner Systems From Binary Codes"
Anthony J. Macula "An Analysis of the Lines in the Three Dimensional Affine Space Over F3"
Marty J. Wolf and David J. Haglin "An Optimal Algorithm for Finding All Convex Subsets in Tournaments"
J. Ghoshal, R. Laskar and D. Pillone "Further Results on Minimal Rankings"
G.B. Khosrovshahi and H.R. Maima "On 2-(v,3) Steiner Trades of Small Volumes"
S. Arumugam and S. Velammal "Maximum Size of a Connected Graph with Given Domination Parameters"
Y.S. Liaw "More Z-Cyclic Room Squares"
Zhi-Hong Chen, Kuang Ying-Qiang and Hong-Jian Lai "Connectivity of cycle matroids and bicircular matroids"
Marina Martinova "An Isomorphic Decomposition of K24"
S. Mishra "Some New Characterizations of Matroids"
Joel Puech "Stability, domination, and irredundance in WAR graphs"
Katja Valentin "Polychrome labelings of trees and cycle"
Bolian Liu and Zhou Bo "A Generalization of Maximal k-Multiple-Free Sets of Integers"
Kathleen A.S. Quinn "Difference Matrices and Orthomorphisms over Non-Abelian Groups"
Noga Alon and Eldar Fischer "Refining the Graph Density Condition for the Existence of Almost K-factors"
Uri Blass and Simon Litsyn "The smallest covering code of length 8 and radius 2 has 12 words"
Back to the Ars Combinatoria page.