Ars Combinatoria
Volume XLI, December, 1995


  • Stathis Chadjiconstantinidis and Kiki Sotirakoglou, "Optimal completely randomized designs for a cyclic covariate model with even replication number"

  • A.H. Baartmans, Cantian Lin and W.D. Wallis, "Symmetric and skew equivalence of Hadamard matrices of order 28"

  • Gerd H. Fricke, Stephen T. Hedetniemi and Michael A. Henning, "Distance independence domination in graphs"

  • Lutz Volkmann, "On graphs with equal domination and edge independence numbers"

  • W.D. Wallis and Wan-Di Wei, "On the spectrum on maximal k-multiple free sets of integers"

  • D.K. Garnick and N.A. Nieuwejaar, "Total domination of the m\times n chessboard by kings, crosses and knights"

  • Denise Sakai Troxell, "Minimizing the number of holes in 2-distant colorings"

  • Ian Anderson and N.J. Finizio, "Cohen's theorem and Z-cycle whist tournaments"

  • A.S. Asratian, "Some properties of graphs with local Ore condition"

  • E.J. Cockayne, G. Fricke, S.T. Hedetniemi and C.M. Mynhardt, "Properties of minimal dominating functions of graphs"

  • Edward Spence, "Five nondual 2-(41,16,6) designs with a trivial automorphism group"

  • Yair Caro, "Exact cuts and a simple proof of the zero graphs theorem"

  • H-D.O.F. Gronau, R.C Mullin and Ch. Pietsch, "The closure of all subsets of {3,4,...10} which include 3"

  • Carla N. Purdy and R. Swaminathan, "On a characterization of series-parallel graphs"

  • J-C. Renaud, "A second approximation to the boundary function on union-closed collections"

  • Michael J. Gilpen and Donald L. Kreher, "A note on spanning trees in near d-angulations"

  • Adrian Riskin, "On the enumeration of polyhedral embeddings of Cartesian products of cycle"

  • Pawel Wlaz and Jerzy Zurawiecki, "An algorithm for the generation of M-sequences using universal circuit matrix"

  • Ciping Chen, "Binding number of graphs and [a,b]-factors"

  • Hong-Jian Lai and Hongyaun Lai, "The size of graphs with given edge inclusive connectivity"

  • Graham Brightwell and Edward R. Scheinerman, "The dual of a circle order is not necessarilty a circle order"

  • N.K. Rayburn, "Mengerian results for distance-n connectivity"

  • A.J. van Zanten, "The ranking problem of a Gray code for compositions"

  • Bolian Liu, "Multiexponents of tournament matrices"

  • Ahmed H. Assaf and L.P.S. Singh, "Tripacking of pairs by quintuples the case v=2 (mod 4)"

  • Mirko Hornak and Roman Sotak, "Observability of complete multipartite graphs with equipotent parts"

  • John W. Krussel, "Distinct degrees determined by subgraphs"

  • I. Cahit, "On harmonious tree labelings"


    Back to the Ars Combinatoria page.