**Ars Combinatoria****Volume CVI, July, 2012**

**Sizhong Zhou and Jiashang Jiang**, “A New Sufficient Condition for Graphs to Have (g,f)-Factors”, pp. 3-9**Qingde Kang, Xiaoshan Liu and Huixian Jia**, “Packings and coverings for four particular graphs each with six vertices and nine edges (λ = 1)”, pp. 11-32**Jianxiu Hao, LiLi He and Min Huang**, “PI Index of Extremal Simple Pericondensed Hexagonal Systems”, pp. 33-46**Shu-Guang Guo**, “On the Laplacian Spectral Radius of Unicyclic Graphs with Fixed Diameter”, pp. 47-58**Mingjun Hu**, “Wiener index of a type of composite graph”, pp. 59-64**A.P. Santhakumaran and P. Titus**, “The Geo-Number Of A Graph”, pp. 65-78**Washiela Fish, Khumbo Kumwenda and Eric Mwambene**, “Codes from embeddings of the strong product of triangular graphs and K_{2}and certain induced subgraphs”, pp. 79-95**Shahzad Basiri**, “On Strong Biclique Covering”, pp. 97-104**A.E. Radwan and S.S. Hussien**, “L-Presheaves and Their Stalks”, pp. 105-114**Ya-Hong Chen and Xiao-Dong Zhang**, “The Wiener Index of Unicyclic Graphs with Girth and Matching Number”, pp. 115-128**James Preen**, “A Census of all 5-regular planar graphs with diameter 3”, pp. 129-135**Cheng-Kuan Lin, Yuan-Kang Shih, Jimmy J.M. Tan and Lih-Hsing Hsu**, “Mutually Independent Hamiltonian Cycles in Some Graphs”, pp. 137-142**Ch. G. Massouros and A. Dramalidis**, “Transposition H_{v}-Groups”, pp. 143-160**Qin Chen and Wensong Lin**, “L(j,k)-Labelings and L(j,k)-Edge-Labelings of Graphs”, pp. 161-172**Hyun Kwang Kim, Dae Kyu Kim and Jon-Lark Kim**, “Type I Codes over GF(4)”, pp. 173-191**Yanfang Zhang**, “Packings and coverings of λK_{v}by the graphs with seven points, seven edges and one 5-circle”, pp. 193-204**Changping Wang**, “The Signed k-Domination Numbers In Graphs”, pp. 205-211**Aubrey Blecher**, “Compositions Of Positive Integers n Viewed As Alternating Sequences Of Increasing/Decreasing Partitions”, pp. 213-224**Xiuli Wang, Shangdi Chen and Maoyuan Zhou**, “Three Constructions of Authentication Codes from Power Function over Finite Fields with Perfect Secrecy”, pp. 225-234**Shung-Liang Wu and Hui-Chuan Lu**, “On the Constructions of New Families of Graceful Graphs”, pp. 235-246**Siping Tang**, “Independence number and [a,b]-factors of graphs”, pp. 247-255**Yonghui Fan, Flavio K. Miyazawa and Yuqin Zhang**, “A Cube-covering Problem”, pp. 257-262**Adel T. Diab and Sayed Anwar Elsaid Mohammed**, “On Cordial Labelings of Fans with Other Graphs”, pp. 263-275**Adel P. Kazemi**, “Roman domination and Mycieleki’s structure in graphs”, pp. 277-287**Premysl Holub**, “The edge-closure of a claw-free graph is the line graph of a multigraph”, pp. 289-295**Victor J.W. Guo**, “Bijective proofs of Gould-Mohanty’s and Raney-Mohanty’s identities”, pp. 297-304**Xiaomin Li, Dengxin Li and Hong-jian Lai**, “Spanning Eulerian Subgraphs in Generalized Prisms”, pp. 305-312**Jaromy Scott Kuhl and Tristan Denley**, “A few remarks on avoiding partial Latin squares”, pp. 313-319**Martin Baca, Marcela Lascsakov and Andrea Semanicova**, “On connection between α-labelings and edge-antimagic labelings of diconnected graphs”, pp. 321-336**Selda Kucukcifci, Ermine Sule Yazici and Curt Lindner**, “The full metamorphosis of λ-fold block designs with block size four into λ-fold triple systems”, pp. 337-351**Chen Shang-di and Yang Chun-Li**, “A New Construction of Multisender Authentication Codes from Symplectic Geometry over Finite Fields”, pp. 353-366**Douglas R. Woodall**, “Colourfully panconnected subgraphs II”, pp. 367-380**Liang Lin and Mei Lu**, “On the zeroth-order general Randic index of cacti”, pp. 381-393**Jyhmin Kuo and Hung-Lin Fu**, “On the Diameter of the Generalized Undirected De Bruijn Graphs”, pp. 395-408**Esamel M. Paluga**, “On the m-Hull Number of the Join and Composition of Graphs”, pp. 409-415**Xingkuo Li, Rongxia Hao and Jiangen Zhang**, “Orientable Embedding Distributions by Genus of Crossing-Digraph”, pp. 417-421**Wenjuan Chen, Muhammad Akram and Yanyong Guan**, “Intuitionistic Fuzzy Subcoalgebras of Coalgebras”, pp. 423-434**Jim Tao and Wen-Qing Xu**, “Maximal Separation On 2-D Arrays”, pp. 435-447**Ali Ahmad, Martin Baca, Yasir Bashir and Muhammad Kamran Siddiqui**, “Total edge irregularity strength of strong product of two paths”, pp. 449-459**Hortensia Galeana-Sanchez, Bernardo Llano and Juan Jose Montellano-Ballesteros**, “Kernels by Monochromatic Directed Paths In m-Colored Digraphs With Quasi-Transitive Chromatic Classes”, pp. 461-471**Danilo Korze and Aleksander Vesel**, “A note on the independence number of strong products of odd cycles”, pp. 473-481**Benyi Beata**, “Bijective proofs of the hook formula for rooted trees”, pp. 483-494**Dragan Stevanovic, Marko Petkovic and Milan Basic**, “On the diameter of integral circulant graphs”, pp. 495-500**Sizhong Zhou**, “Orthogonal (g,f)-Factorization in Graphs”, pp. 501-508**Haiying Wang and Chuantao Li**, “New results on sum graph theory”, pp. 509-519**Jianxiu Hao**, “Theorems About PI Indices”, pp. 521-526**Ioan Tomescu and Akhlaq Ahmad Bhatti**, “On The Cyclomatic Number Of Linear Hypergraphs”, pp. 527-533