Optimal completely randomized designs for a cyclic covariate model with even replication number
Chadjiconstantinidis, Stathis; Sotirakoglou, Kiki
Ars Comb. 41, 3-24 (1995).
Symmetric and skew equivalence of Hadamard matrices of order \(28\)
Baartmans, A. H.; Lin, Cantian; Wallis, W. D.
Ars Comb. 41, 25-31 (1995).
Distance independent domination in graphs
Fricke, Gerd H.; Hedetniemi, Stephen T.; Henning, Michael A.
Ars Comb. 41, 33-44 (1995).
On graphs with equal domination and edge independence numbers
Volkmann, Lutz
Ars Comb. 41, 45-56 (1995).
On the spectrum of maximal \(k\)-multiple free sets of integers
Wallis, W. D.; Wei, Wan-Di
Ars Comb. 41, 57-64 (1995).
Total domination of the m×n chessboard by kings, crosses, and knights
Garnick, D. K.; Nieuwejaar, N. A.
Ars Comb. 41, 65-75 (1995).
Minimizing the number of holes in \(2\)-distant colorings
Troxell, Denise Sakai
Ars Comb. 41, 77-86 (1995).
Cohen’s theorem and Z-cyclic whist tournaments
Anderson, Ian; Finizio, Norman J.
Ars Comb. 41, 87-96 (1995).
Some properties of graphs with local Ore condition
Asratian, A. S.
Ars Comb. 41, 97-106 (1995).
Properties of minimal dominating functions of graphs
Cockayne, E. J.; Fricke, G.; Hedetniemi, S. T.; Mynhardt, C. M.
Ars Comb. 41, 107-115 (1995).
Five nondual \(2-(41,16,6)\) designs with a trivial automorphism group
Spence, Edward
Ars Comb. 41, 117-122 (1995).
Exact cuts and a simple proof of the zero graphs theorem
Caro, Yair
Ars Comb. 41, 123-128 (1995).
The closure of all subsets of {3,4,…,10} which include 3
Gronau, H.-D. O. F.; Mullin, R. C.; Pietsch, Ch.
Ars Comb. 41, 129-161 (1995).
On a characterization of series-parallel graphs
Purdy, Carla N.; Swaminathan, R.
Ars Comb. 41, 163-175 (1995).
A second approximation to the boundary function on union-closed collections
Renaud, J.-C.
Ars Comb. 41, 177-188 (1995).
A note on spanning trees in near d-angulations
Gilpin, Michael J.; Kreher, Donald L.
Ars Comb. 41, 189-192 (1995).
On the enumeration of polyhedral embeddings of Cartesian products of cycles
Riskin, Adrian
Ars Comb. 41, 193-198 (1995).
A note on \((m,2,m−1,m−22)\) relative difference sets
Xiang, Qing
Ars Comb. 41, 199-202 (1995).
An algorithm for the generation of \(M\)-sequences using universal circuit matrix
Wlaź, Paweł; Żurawiecki, Jerzy
Ars Comb. 41, 203-216 (1995).
Binding number of graphs and \([a,b]\)-factors
Chen, Ciping
Ars Comb. 41, 217-224 (1995).
The size of graphs with given edge inclusive connectivity
Lai, Hong-Jian; Lai, Hongyuan
Ars Comb. 41, 225-239 (1995).
The dual of a circle order is not necessarily a circle order
Brightwell, Graham; Scheinerman, Edward R.
Ars Comb. 41, 240-246 (1995).
Mengerian results for distance-\(n\) connectivity
Rayburn, N. K.
Ars Comb. 41, 247-256 (1995).
The ranking problem of a Gray code for compositions
van Zanten, A. J.
Ars Comb. 41, 257-268 (1995).
Multiexponents of tournament matrices
Liu, Bolian
Ars Comb. 41, 269-277 (1995).
Tripacking of pairs by quintuples. The case \(ν≡2(mod4)\)
Assaf, Ahmed H.; Singh, L. P. S.
Ars Comb. 41, 278-288 (1995).
Observability of complete multipartite graphs with equipotent parts
Horňák, Mirko; Soták, Roman
Ars Comb. 41, 289-301 (1995).
degrees determined by subgraphs
Krussel, John W.
Ars Comb. 41, 302-310 (1995).
On harmonious tree labelings
Cahit, I.
Ars Comb. 41, 311-317 (1995).
