Ars Combinatoria
Volume LXXVI, July, 2005
- C.F.X. de Mendonca, E.F. Xavier, J. Stolfi, L. Faria and C.M.H. de Figueiredo, “The non planar vertex deletion of Cn x Cm”
- Jill R. Faudree and Ronald J. Gould, “A Note on Neighborhood Unions and Independent Cycles”
- Michael D. Hirschhorn and James A. Sellers, “Further results for partitions into four squares of equal parity”
- Jian-Liang Wu, Ping Wang and Anthony Hilton, “Two sufficient conditions for a graph to be type 1”
- Thomas Bier and Peter @ Suresh Padmanabhan, “Some Formulas for Generalized Stirling Numbers”
- Candida Nunes da Silva and Ricardo Dahab, “Tutte’s 3-flow Conjecture and Matchings in Bipartite Graphs”
- Andrea Vietri, “Chromatic number of regular walls”
- Shannon L. Fitzpatrick and Gary MacGillivray, “Non 3-Choosable Bipartite Graphs and The Fano Plane”
- D.J. Ashe, C.A. Rodger and H.L. Fu, “All 2-Regular Leaves of Partial 6-cycle Systems”
- A.K. Agarwal, “New Classes of Combinatorial Identities”
- M.A. Ollis and P. Spiga, “Every abelian group of odd order has a narcissistic terrace”
- Teresa W. Haynes, Michael A. Henning and Peter J. Slater, “Trees with Equal Domination and Paired-domination Numbers”
- Hiroshi Era, Kenjiro Ogawa and Morimasa Tsuchiya, “Note on transformation of posets with the same semi bound graphs”
- Emanuele Munarini, “Enumeration of order ideals of a garland”
- Ewa M. Kubicka, “Polynomial Algorithm for Finding Chromatic Sum for Unicyclic and Outerplanar Graphs”
- M.M. Cropper and Peter D. Johnson, Jr., “Problems on Hall t-chromaticity”
- Z. Bogdanowicz, “Hamiltonian Circuits in Sparse Circulant Digraphs”
- Hikoe Enomoto, Jun Fujisawa and Katsuhiro Ota, “A sk type condition for heavy cycles in weighted graphs”
- Tao-Ming Wang, “On line graphs which are weakly maximal clique irreducible”
- Lane Clark, “Comment on “Properly Coloured Hamiltonian Paths in Edge-coloured Complete Graphs without Monochromatic Triangles””
- Maged Z. Youssef, “Pseudograceful Labelings of Cycles”
- Miranca Fischermann, Dieter Rautenbach and Lutz Volkmann, “Extremal Trees with Respect to Dominance Order”
- Nasrin Soltankhah and E.S. Mahmoodian, “On defining numbers of k-chromatic k-regular graphs”
- Arie Bialostocki and Rasheed Sabar, “On constrained 2-Partitions of monochromatic sets and generalizations in the sense of Erdos-Ginzburg-Ziv”
- Arnold Knopfmacher and Neville Robbins, “Compositions with parts constrained by the leading summand”
- G. Sethuraman and A. Elumalai, “Packing of any set of graphs into a graceful/harmonious/elegant graphs”
- Ligong Wang, Xueliang Li and C. Hoede, “Two Classes of Integral Regular Graphs”
- Sergey Kitaev and Toufik Mansour, “On multi-avoidance of generalized patterns”