The non planar vertex deletion of \(C_{n}\times C_{m}\)
de Mendonça, C. F. X.; Xavier, E. F.; Stolfi, J.; Faria, L.; de Figueiredo, C. M. H.
Ars Comb. 76, 3-28 (2005).
A note on neighborhood unions and independent cycles
Faudree, Jill R.; Gould, Ronald J.
Ars Comb. 76, 29-31 (2005).
Further results for partitions into four squares of equal parity
Hirschhorn, Michael D.; Sellers, James A.
Ars Comb. 76, 33-45 (2005).
Two sufficient conditions for a graph to be type 1
Wu, Jian-Liang; Wang, Ping; Hilton, Anthony
Ars Comb. 76, 47-64 (2005).
Some formulas for generalized Stirling numbers
Bier, Thomas; Padmanabhan, Peter Suresh
Ars Comb. 76, 65-82 (2005).
Tutte’s 3-flow conjecture and matchings in bipartite graphs
da Silva, Cândida Nunes; Dahab, Ricardo
Ars Comb. 76, 83-95 (2005).
Chromatic number of regular walls
Vietri, Andrea
Ars Comb. 76, 97-111 (2005).
Non 3-choosable bipartite graphs and the Fano plane
Fitzpatrick, Shannon L.; MacGillivray, Gary
Ars Comb. 76, 113-127 (2005).
All 2-regular leaves of partial 6-cycle systems
Ashe, D. J.; Rodger, C. A.; Fu, H. L.
Ars Comb. 76, 129-150 (2005).
New classes of combinatorial identities
Agarwal, A. K.
Ars Comb. 76, 151-160 (2005).
Every Abelian group of odd order has a narcissistic terrace
Ollis, M. A.; Spiga, P.
Ars Comb. 76, 161-168 (2005).
Trees with equal domination and paired-domination numbers
Haynes, Teresa W.; Henning, Michael A.; Slater, Peter J.
Ars Comb. 76, 169-175 (2005).
Note on transformation of posets with the same semi bound graphs
Era, Hiroshi; Ogawa, Kenjiro; Tsuchiya, Morimasa
Ars Comb. 76, 177-184 (2005).
Enumeration of order ideals of a Garland
Munarini, Emanuele
Ars Comb. 76, 185-192 (2005).
Polynomial algorithm for finding chromatic sum for unicyclic and outerplanar graphs
Kubicka, Ewa M.
Ars Comb. 76, 193-201 (2005).
Problems on Hall t-chromaticity
Cropper, M. M.; Johnson, Peter D. jun.
Ars Comb. 76, 203-212 (2005).
Hamiltonian circuits in sparse circulant digraphs
Bogdanowicz, Z.
Ars Comb. 76, 213-223 (2005).
A σk type condition for heavy cycles in weighted graphs
Enomoto, Hikoe; Fujisawa, Jun; Ota, Katsuhiro
Ars Comb. 76, 225-232 (2005).
On line graphs which are weakly maximal clique irreducible
Wang, Tao-Ming
Ars Comb. 76, 233-238 (2005).
Comment on “Properly coloured Hamiltonian paths in edge-coloured complete graphs without monochromatic triangles”
Clark, Lane
Ars Comb. 76, 239-240 (2005).
Pseudograceful labelings of cycles
Youssef, Maged Z.
Ars Comb. 76, 241-247 (2005).
Extremal trees with respect to dominance order
Fischermann, Miranca; Rautenbach, Dieter; Volkmann, Lutz
Ars Comb. 76, 249-255 (2005).
On defining numbers of k-chromatic k-regular graphs
Soltankhah, Nasrin; Mahmoodian, E. S.
Ars Comb. 76, 257-276 (2005).
On constrained 2-partitions of monochromatic sets and generalizations in the sense of Erdős-Ginzburg-Ziv
Bialostocki, Arie; Sabar, Rasheed
Ars Comb. 76, 277-286 (2005).
Compositions with parts constrained by the leading summand
Knopfmacher, Arnold; Robbins, Neville
Ars Comb. 76, 287-295 (2005).
Packing of any set of graphs into a graceful / harmonious / elegant graph
Sethuraman, G.; Elumalai, A.
Ars Comb. 76, 297-301 (2005).
Two classes of integral regular graphs
Wang, Ligong; Li, Xueliang; Hoede, C.
Ars Comb. 76, 303-319 (2005).
On multi-avoidance of generalized patterns
Kitaev, Sergey; Mansour, Toufik
Ars Comb. 76, 321-350 (2005).
