**Ars Combinatoria****Volume XCVII, October, 2010**

**Giovanni Lo Faro and Antoinette Tripodi**, “Diagonally switchable λ-fold 4-cycle systems, λ > 1”**Yongqiang Zhao and Gerard J. Chang**, “On competition polysemy and m-competition polysemy”**Jenq-Jong Lin**, “Quasi-tree graphs with the largest number of maximal independent sets”**Stephan Foldes and Erkko Lehtonen**, “Column-Partitioned Matrices Over Rings Without Invertible Transversal Submatrices ”**K.M. Kathiresan and S. Amutha**, “Fibonacci Graceful Graphs ”**M. Asghari-Larimi and B. Davvaz**, “Hyperstructures associated to arithmetic functions”**G.C. Lau, Y.H. Peng and Kamel Ariffin Mohd. Atan**, “Chromaticity of Complete Tripartite Graphs With Certain Star or Matching Deleted”**Yu Xiong and Jun Ma**, “Combinatorial properties of codes with w-identifiable parents property”**Heping Zhang and Shan Zhou**, “A note on path factors in claw-free graphs”**Jennie Danielsson**, “A computer search for minimal blocking sets in PG(2,q)”**Yangjiang Wei, Jizhu Nan, Gaohua Tang and Huadong Su**, “The Cubic Mapping Graph of the Residue Classes of Integers”**M.M. Shikare and B.N. Waphare**, “Excluded-Minors For The Class Of Graphic Splitting Matroids”**Liming Xiong and Mingchu Li**, “Supereulerian index is stable under contractions and closures”**A.P. Burger, M.P. Kidd and J.H. van Vuuren**, “Enumeration of isomorphism classes of self-orthogonal Latin squares”**Ibrahim Gunaltili**, “Pseudo-Complements In Finite Projective Planes”**Maged Z. Youssef and E.A. Elsakhawai**, “Graph operations and cordiality”**Meirun Chen and Xiaofeng Guo**, “Lower and Upper Orientable Strong Radius and Strong Diameter of the Cartesian Product of Complete Graphs ”**Hongxia Liu and Guizhen Liu**, “On fractional (g,f,n)-critical graphs”**Xue-gang Chen and Wai Chee Shiu**, “A note on weakly connected domination number in graphs”**Sergey Kitaev and Artem Pyatkin**, “On avoidance of V- and ^-patterns in permutations”**Huajun Meng, Fang-Ming Shao and Xiwen Lu**, “Uniformly Least Reliable Graphs in Class Ω(n,e) as e ≤ n+1”**Feng-Zhen Zhao and Wuyungaowa**, “Some Identities for Leibniz Numbers”**Shubo Chen and Houqing Zhou**, “Extremal Zagreb indices of unicyclic graphs”**R. Balakrishnan. N. Sridharan and K. Viswananathan Iyer**, “A Sharp Lower Bound for the Wiener Index of a Graph”**Tay-Woei Shyu**, “Decompositions of Complete Graphs Into Paths and Cycles”**Ludovit Niepel and Martin Knor**, “Domination In The Cross Product Of Digraphs”**Nuriye Battaloglu, Cengiz Cinar and Ibrahim Yalcinkaya**, “The Dynamics Of The Difference Equation x_{n+1}={α x_{n-k}}/{β +γ x^{p_{n-(k+1)}}”**Bolian Liu and Fengying Huang**, “Enumeration for no-trivial spanning forests of complete bipartite graphs”**Amir Daneshgar, Hossein Hajiabolhassan and Siamak Taati**, “On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs”**Chengfu Qin and Xiaofeng Guo**, “Contractible edges of k-connected graphs for k = 4,5”**R. Laue, G.R. Omidi and B. Tayfeh-Rezaie**, “Large sets of t-designs from t-homogeneous groups”**Khalil Shahbazpour**, “A Contribution to the characterization of Quasi-groups that are Isotopic to Abelian groups”**Soumen Maity and Subhamoy Maitra**, “Minimum Distance between Bent and 1-resilient Boolean Functions”**Meirun Chen and Xiaofeng Guo**, “On Vertex-Distinguishing Proper Edge Colorings of Graphs Satisfying the Ore Condition”**Yongli Zhang, Yanpei Liu and Junliang Cai**, “Enumeration of Unicursal Planar Near-Triangulation”**Ping Zhao and Kefeng Diao**, “Upper Chromatic Number of Steiner Triple Systems”**Atif Abueida and Christian Hampson**, “Multidecomposition of K_{n}– F into Graph-Pairs of Order 5 where F is a Hamilton Cycle or an (almost) 1-Factor ”**Jinyang Chen**, “Super Edge-connectivity of Transformation Graphs G^{-++}”**M.M.M. Jaradat**, “A new upper bound of the basis number of the lexicographic product of graphs”**K.J. Asciak, M.A. Francalanza, J. Lauri and W. Myrvold**, “A survey of some open questions in reconstruction numbers”**Yongqiang Zhao and Gerard J. Chang**, “Multicompetition numbers of some multigraphs”**Sule Ayar Ozbal and Alev Firat**, “Symmetric f Bi-Derivations Of Lattices”**Jenq-Jong Lin**, “Maximum Packings of Complete Graphs with Octagons”**John Mitchem and Randolph L. Schmidt**, “On the Erdos-Faber-Lovasz Conjecture”**Xianghong Xu and Weijun Liu**, “On flag-transitive 6 – (v,k,λ) designs with λ ≤ 5”**Hung-Chih Lee**, “Packing and Covering Complete Bipartite Multidigraphs with 6-circuits”**Neil P. Carnes and Anne Dye**, “A Special Class of Anti-automorphisms of Directed Triple Systems”