Balanced part ternary designs: Some new results
Kunkle, Thomas; Sarvate, Dinesh G.
J. Comb. Math. Comb. Comput. 22, 3-11 (1996).
Existence of some (3, 2, 1)-HCOLS and (3, 2, 1)-ICOILS
Zhang, Hantao; Bennett, Frank E.
J. Comb. Math. Comb. Comput. 22, 13-22 (1996).
Connecting the permutation representations of a group
Siemons, Johannes
J. Comb. Math. Comb. Comput. 22, 23-31 (1996).
Logarithms, syndrome functions, and the information rates of greedy loop transversal codes
Hsu, F.-L.; Hummer, F. A.; Smith, J. D. H.
J. Comb. Math. Comb. Comput. 22, 33-49 (1996).
Complexity of scheduling problems with generalized due dates
Wong, C. S.; Yan, Monique; Young, Gilbert H.
J. Comb. Math. Comb. Comput. 22, 51-63 (1996).
On a conjecture concerning self-conjugate self-orthogonal diagonal Latin squares
Du, Beiliang
J. Comb. Math. Comb. Comput. 22, 65-66 (1996).
Computing geodetic bases of chordal and split graphs
Douthat, Aaron L.; Kong, Man C.
J. Comb. Math. Comb. Comput. 22, 67-77 (1996).
Reed-Muller codes and Hadamard designs from ovals
Carpenter, L. L.; Key, J. D.
J. Comb. Math. Comb. Comput. 22, 79-85 (1996).
Large subgraphs of minimal density or degree
Erdős, Paul; Faudree, Ralph J.; Jagota, Arun; Łuczak, Tomasz
J. Comb. Math. Comb. Comput. 22, 87-96 (1996).
Asymmetric digraphs with prescribed m-median and m-periphery
Bertz, Lyle; Tian, Songlin
J. Comb. Math. Comb. Comput. 22, 97-110 (1996).
Subsequences of a multiset
Wu, Jun
J. Comb. Math. Comb. Comput. 22, 111-124 (1996).
A note on powers and proper circular-arc graphs
Prisner, Erich
J. Comb. Math. Comb. Comput. 22, 125-128 (1996).
Greedy loop transversal codes, metrics, and lexicodes
Hummer, F. A.; Smith, J. D. H.
J. Comb. Math. Comb. Comput. 22, 143-155 (1996).
The higher-order edge toughness of a graph and truncated uniformly dense matroids
Chen, Zhi-Hong; Lai, Hong-Jian
J. Comb. Math. Comb. Comput. 22, 157-160 (1996).
On the minimum co-operative guard problem
Deogun, Jitender S.; Sarasamma, Suseela T.
J. Comb. Math. Comb. Comput. 22, 161-182 (1996).
Some hypergraph questions suggested by a Nordic Olympiad problem
Rousseau, Cecil; Tuza, Zsolt
J. Comb. Math. Comb. Comput. 22, 183-192 (1996).
On labeling of some graphs
Kang, Qing-de; Liang, Zhi-he; Gao, Yin-zhi; Yang, Gui-hua
J. Comb. Math. Comb. Comput. 22, 193-210 (1996).
Towards deciding the existence of 2-(22, 8, 4) designs
McKay, Brendan D.; Radziszowski, Stanisław P.
J. Comb. Math. Comb. Comput. 22, 211-222 (1996).
A note on mod (2p+1)-orientable graphs
Lai, Hong-Jian
J. Comb. Math. Comb. Comput. 22, 223-224 (1996).
On Veronese’s decomposition theorem and the geometry of outer automorphisms of S6
Cárdenas, Humberto; San Agustín, Rodolfo
J. Comb. Math. Comb. Comput. 22, 225-239 (1996).
(27,13,6) designs with an automorphism of order 3
Mackenzie-Fleming, Kirsten; Smith, Ken W.
J. Comb. Math. Comb. Comput. 22, 241-253 (1996).
