Erratum to: Steiner triple systems of order 21 with automorphisms of order 7
Tonchev, Vladimir D.
Ars Comb. 39, 3 (1995).
A method of studying the multiplier conjecture and some partial solutions for it
Qiu, Weisheng
Ars Comb. 39, 5-23 (1995).
Greedy ordered sets with no four-cycles
Zaguia, Nejib
Ars Comb. 39, 25-32 (1995).
Latin squares: Critical sets and their lower bounds
Donovan, Diane; Cooper, Joan; Nott, D. J.; Seberry, Jennifer
Ars Comb. 39, 33-48 (1995).
Graceful paths to edge-graceful trees
Simoson, Andrew; Simoson, Christopher
Ars Comb. 39, 49-64 (1995).
E
xistence of self-orthogonal Latin squares ISOLS(6m+2,2m)
Zhu, L.
Ars Comb. 39, 65-74 (1995).
Regular triples with respect to a hyperoval
Maschietti, Antonio
Ars Comb. 39, 75-88 (1995).
Designs having the parameters of PGi+1(d+1,q)
Mackenzie-Fleming, Kirsten
Ars Comb. 39, 89-92 (1995).
A counter example to a conjecture of Gallai
Zhou, Bing
Ars Comb. 39, 93-96 (1995).
Permutations with unique fixed and reflected points
Simpson, Todd
Ars Comb. 39, 97-108 (1995).
Inequalities for total matchings of graphs
Gimbel, John; Vestergaard, Preben D.
Ars Comb. 39, 109-119 (1995).
A dominating property of i-center in Pt-free graphs
Liu, Jiping; Yu, Qinglin
Ars Comb. 39, 121-127 (1995).
Stolarsky interspersions
Kimberling, Clark
Ars Comb. 39, 129-138 (1995).
Toward computing m(4)
Goldberg, Mark K.; Russell, Hilton C.
Ars Comb. 39, 139-148 (1995).
Ramsey numbers for induced regular subgraphs
Fajtlowicz, Siemion; McColgan, Tamara; Reid, Talmage; Staton, William
Ars Comb. 39, 149-154 (1995).
losing S3 recognition algorithm
Casali, Maria Rita
Ars Comb. 39, 155-160 (1995).
On 2-(v,4,λ)-designs without pair intersections
Gronau, Hans-Dietrich O. F.; Nešetřil, Jaroslav
Ars Comb. 39, 161-165 (1995).
Bandwidth of the composition of certain graph powers
Chinn, Phyllis Zweig; Lin, Yixun; Yuan, Jinjiang; Williams, Kenneth
Ars Comb. 39, 167-173 (1995).
Permutation-type formulas of Frobenius map and their applications
Chen, Zhibo
Ars Comb. 39, 175-181 (1995).
When is a complex matrix a character table? A reduction to vertex independence
Zaverdinos, C.
Ars Comb. 39, 183-188 (1995).
A characterization of well-covered claw-free graphs containing no 4- cycles
Whitehead, C. A.
Ars Comb. 39, 189-198 (1995).
Extreme values of the edge-neighbor-connectivity
Cozzens, Margaret B.; Wu, Shu-Shih Y.
Ars Comb. 39, 199-210 (1995).
Map duality and generalizations
Vince, Andrew
Ars Comb. 39, 211-229 (1995).
Constructions of simple cyclic 2-designs
Shen, Hao; Wen, Hong
Ars Comb. 39, 231-239 (1995).
A composition theorem for simple designs and difference families
Narayani, Lakshmi; Blanchard, John L.
Ars Comb. 39, 240-248 (1995).
On Leech’s tree labelling problem
Yang, Yuansheng; Zhang, Chengxue; Ding, Shanjing
Ars Comb. 39, 249-254 (1995).
Consecutive-integer partitions
Guerin, E. E.
Ars Comb. 39, 255-260 (1995).
On resolvable BIBDs with block size five
Miao, Y.; Zhu, L.
Ars Comb. 39, 261-275 (1995).
A completion of the spectrum for large sets of disjoint ordered triple systems
Chang, Yanxun
Ars Comb. 39, 276-280 (1995).
There is no binary linear [66,13,28]-code
Daskalov, Rumen N.
Ars Comb. 39, 281-285 (1995).
