On bicovers of pairs by quintuples: v odd, v≢3 (mod 10)
Mullin, R. C.; Horton, J. D.; Mills, W. H.
Ars Comb. 31, 3-19 (1991).
Counting special sets of binary Lyndon words
Yucas, Joseph L.
Ars Comb. 31, 21-29 (1991).
A bijective proof for the parity of Stirling numbers
Collins, Karen L.; Hovey, Mark
Ars Comb. 31, 31-32 (1991).
Orthogonal Steiner triple systems of order 6m+3
Stinson, D. R.; Zhu, Lie
Ars Comb. 31, 33-63 (1991).
Minimum triangle-free graphs
Radziszowski, Stanisław P.; Kreher, Donald L.
Ars Comb. 31, 65-92 (1991).
A characterization of fractionally well-covered graphs
Currie, James; Nowakowski, Richard
Ars Comb. 31, 93-96 (1991).
On a class of linear spaces with 16 points
Franek, F.; Mathon, R.; Rosa, A.
Ars Comb. 31, 97-104 (1991).
Steiner heptagon systems
Manduchi, Elisabeth
Ars Comb. 31, 105-115 (1991).
Ramsey minimal graphs for forests
Faudree, Ralph
Ars Comb. 31, 117-124 (1991).
Addendum to: On the construction of color-critical linear hypergraphs
Abbott, H. L.; Hare, D. R.
Ars Comb. 31, 125-126 (1991).
On the cordiality of some specific graphs
Kirchherr, Walter W.
Ars Comb. 31, 127-138 (1991).
Neighborhood unions and highly Hamiltonian graphs
Faudree, Ralph J.; Gould, Ronald J.; Jacobson, Michael S.; Lesniak, Linda
Ars Comb. 31, 139-148 (1991).
On the vulnerability of permutation graphs of complete and complete bipartite graphs
Guichard, D.; Piazza, B.; Stueckle, S.
Ars Comb. 31, 149-157 (1991).
k-saturated graphs of chromatic number at least k
Hanson, D.; Toft, B.
Ars Comb. 31, 159-164 (1991).
Symmetric designs with λ=2 admitting PSL(2,q) fixing a block
Fanning, J. D.
Ars Comb. 31, 165-170 (1991).
Composing functions to reduce image size
Sauer, N.; Stone, M. G.
Ars Comb. 31, 171-176 (1991).
A Turan-type problem on 3-graphs
Zhou, Bing
Ars Comb. 31, 177-181 (1991).
A lattice generated by (0,1)-matrices
Brualdi, Richard A.; Liu, Bolian
Ars Comb. 31, 183-190 (1991).
Minimal number of cuts for fair division
Robertson, Jack M.; Webb, William A.
Ars Comb. 31, 191-197 (1991).
Contractible edges in 4-connected maximal planar graphs
McCuaig, William D.; Haglin, David J.; Venkatesan, Shankar M.
Ars Comb. 31, 199-203 (1991).
Reguli in translation planes defined by flocks of hyperbolic quadrics
Johnson, N. L.
Ars Comb. 31, 205-210 (1991).
Incomplete perfect Mendelsohn designs
Bennett, F. E.; Chen, Maorong
Ars Comb. 31, 211-216 (1991).
A new assignment model and its algorithms
Song, Zengmin; Zhang, Kemin
Ars Comb. 31, 217-221 (1991).
Domination number of products of graphs
El-Zahar, M.; Pareek, C. M.
Ars Comb. 31, 223-227 (1991).
Fusion schemes and partially balanced incomplete block designs
Hemmeter, Joe; Woldar, Andrew
Ars Comb. 31, 229-236 (1991).
A property of t-wise balanced designs
Kageyama, Sanpei
Ars Comb. 31, 237-238 (1991).
Cycle-book Ramsey numbers
Faudree, R. J.; Rousseau, C. C.; Sheehan, J.
Ars Comb. 31, 239-248 (1991).
On the construction of cordial graphs
Seah, Eric
Ars Comb. 31, 249-254 (1991).
Some small packing numbers
Gardner, B.
Ars Comb. 31, 255-258 (1991).
Regular triangulations of non-compact surfaces
Mohar, Bojan
Ars Comb. 31, 259-266 (1991).
Almost selfcomplementary graphs. I
Das, Pramod K.
Ars Comb. 31, 267-276 (1991).
Totally colouring a graph with maximum degree four
Jones, Kathryn F.; Ryan, Jennifer
Ars Comb. 31, 277-285 (1991).
On the packing of pairs by quintuples with index 2
Yin, Jianxing
Ars Comb. 31, 287-301 (1991).
Eulerian subgraphs in a class of graphs
Lai, Hong-Jian
Ars Comb. 31, 302-311 (1991).
The chromatic index of an abelian Cayley graph
Broere, Izak; Hattingh, Johannes H.
Ars Comb. 31, 312-316 (1991).
