Additive permutations of cardinality seven
Abrham, Jaromir
Ars Comb. 23A, 7-28 (1987).
Covers of symmetric designs
Aldred, R. E. L.; Godsil, C. D.
Ars Comb. 23A, 29-34 (1987).
Total concepts in graph theory
Behzad, M.
Ars Comb. 23A, 35-40 (1987).
Lattices associated to the rectangular association scheme
Bier, Thomas
Ars Comb. 23A, 41-50 (1987).
On cycles in graphs
Caccetta, L.; Vijayan, K.
Ars Comb. 23A, 51-65 (1987).
On a characterization of comparability graphs
Chan, O.; Chen, C. C.; Slater, P.
Ars Comb. 23A, 67-79 (1987).
An application of combinatorial group theory to coding
Cohen, Gérard; Zemor, Gilles
Ars Comb. 23A, 81-89 (1987).
Realizing small leaves of partial triple systems
Colbourn, Charles J.
Ars Comb. 23A, 91-94 (1987).
An algorithm for detecting symmetries in drawings
Eades, Peter; Ng, Hoe Chin
Ars Comb. 23A, 95-104 (1987).
Three unsolved problems in graph theory
Eggleton, Roger B.
Ars Comb. 23A, 105-121 (1987).
Group signings of symmetric balanced incomplete block designs
Gibbons, Peter B.; Mathon, Rudolf A.
Ars Comb. 23A, 123-134 (1987).
Generalizing Kuratowski’s theorem from R2 to R4
Gillman, David
Ars Comb. 23A, 135-140 (1987).
On (I,n)-regular graphs
Henning, M. A.; Swart, Henda C.; Winter, P. A.
Ars Comb. 23A, 141-152 (1987).
Minimal extensions of sequences associated with BD-graphs
Huang, H. C.; Koh, K. M.
Ars Comb. 23A, 153-162 (1987).
Vertex-gluings of graphs with their closed-set lattices
Koh, K. M.; Poh, K. S.
Ars Comb. 23A, 163-177 (1987).
Independent sets in regular graphs of high girth
McKay, B. D.
Ars Comb. 23A, 179-185 (1987).
Coset diagrams for a homomorhic image of Δ(2,3,6)
Mushtaq, Q.; Shaheen, F.
Ars Comb. 23A, 187-193 (1987).
k-minimal domination numbers of cycles
Mynhardt, C. M.; Cockayne, E. J.
Ars Comb. 23A, 195-206 (1987).
On automorphism groups of imprimitive symmetric graphs
Praeger, Cheryl E.
Ars Comb. 23A, 207-224 (1987).
On graceful graphs: Cycles with a Pk-chord, k≥4
Punnim, N.; Pabhapote, N.
Ars Comb. 23A, 225-228 (1987).
Bounds for all-terminal reliability by arc-packing
Ramanathan, Aparna; Colbourn, Charles J.
Ars Comb. 23A, 229-236 (1987).
On harmonious and related graphs
Shee, Szechin
Ars Comb. 23A, 237-247 (1987).
A characterization of information networks
Surma, C.
Ars Comb. 23A, 249-258 (1987).
Extending partial generalized Latin rectangles with restraints
Tay, Tiongseng
Ars Comb. 23A, 259-267 (1987).
Modelling knowledge information systems using inference nets
Teh, Hoon Heng; Hsu, Loke Soo; Tsang, Wai Wan
Ars Comb. 23A, 269-290 (1987).
A decision tree algorithm for squaring histograms in random number generation
Tsang, Wai Wan; Marsaglia, George
Ars Comb. 23A, 291-301 (1987).
On the ai, bi chromatic number of a graph
Winter, P. A.
Ars Comb. 23A, 303-314 (1987).
New progress in Pólya’s theory
Ji, Zhong
Ars Comb. 23A, 315-324 (1987).
