Volume LX, July, 2001

Research Article

Recursive constructions of balanced incomplete block designs with block size of 7, 8 or 9

Greig, Malcolm

Ars Comb. 60, 3-54 (2001).

Research Article

On the toughness of the middle graph of a graph

Nihei, Masakazu

Ars Comb. 60, 55-58 (2001).

Research Article

Weak exponent of indecomposability of an irreducible Boolean matrix

Zhou, Bo

Ars Comb. 60, 59-63 (2001).

Research Article

Transformation of spanning trees in a 2-connected graph

Nakamura, Takayuki; Yoshimoto, Kiyoshi

Ars Comb. 60, 65-71 (2001).

Research Article

On the independence number of the Cartesian product of caterpillars

Martin, Scott P.; Powell, Jeffrey S.; Rall, Douglas F.

Ars Comb. 60, 73-84 (2001).

Research Article

Graceful labelings of cyclic snakes

Barrientos, Christian

Ars Comb. 60, 85-96 (2001).

Research Article

(2mod4)-cycles.

Cai, Xiaotao; Shreve, Warren E.

Ars Comb. 60, 97-129 (2001).

Research Article

The Ramsey multiplicity of \(K_{4}\)

Piwakowski, Konrad; Radziszowski, Stanisław P.

Ars Comb. 60, 131-135 (2001).

Research Article

On \((k,l)\)-kernels of orientations of special graphs

Kucharska, Magdalena

Ars Comb. 60, 137-147 (2001).

Research Article

The jump number of \(P\times n\)

Bae, Deok Rak; Kim, Jong Youl

Ars Comb. 60, 149-159 (2001).

Research Article

The connectivity of matching transformation graphs of cubic bipartite plane graphs

Sheng, Bau

Ars Comb. 60, 167-169 (2001).

Research Article

Cycles in the cycle prefix digraph

Comellas, F.; Mitjana, M.

Ars Comb. 60, 171-180 (2001).

Research Article

List edge colorings of outerplanar graphs

Hackmann, Andrea; Kemnitz, Arnfried

Ars Comb. 60, 181-185 (2001).

Research Article

On the matching polynomials of the complete \(n\)-partite graph

Nihei, Masakazu

Ars Comb. 60, 187-192 (2001).

Research Article

On the chromatic uniqueness of edge-gluing of complete bipartite graphs and cycles

Chia, G. L.; Ho, Chee-Kit

Ars Comb. 60, 193-199 (2001).

Research Article

On the girth of digraphs with high connectivity

Shen, Jian; Gregory, D. A.

Ars Comb. 60, 201-207 (2001).

Research Article

Asymptotically good choice numbers of multigraphs

Kayll, P. Mark

Ars Comb. 60, 209-217 (2001).

Research Article

Some identities related to Ramanujan’s tau function

Robbins, Neville

Ars Comb. 60, 219-224 (2001).

Research Article

The connectivities of trunk graphs of 2-connected graphs

Yoshimoto, Kiyoshi

Ars Comb. 60, 225-237 (2001).

Research Article

Families of 4-sets without property B

Abbott, H. L.; Hare, D. R.

Ars Comb. 60, 239-245 (2001).

Research Article

A problem on linear functions and subsets of a finite field

Ng, W. S.

Ars Comb. 60, 247-253 (2001).

Research Article

Clique graphs of Helly circular-arc graphs

Durán, Guillermo; Lin, Min Chih

Ars Comb. 60, 255-271 (2001).

Research Article

Some theorems on generalized Stirling numbers

Corcino, Roberto B.

Ars Comb. 60, 273-286 (2001).

Research Article

A characterization of edge clique graphs

Cerioli, Márcia R.; Szwarcfiter, Jayme L.

Ars Comb. 60, 287-292 (2001).

Research Article

Directed bipartite graphs containing every possible pair of directed cycles

Wang, Hong

Ars Comb. 60, 293-306 (2001).

Research Article

Bounds on domination number of complete grid graphs

Chérifi, Rachid; Gravier, Sylvain; Zighem, Ismaïl

Ars Comb. 60, 307-311 (2001).

Research Article

On the face lattice of a poset polyhedron

Foldes, Stephan; Lawrenz, Alexander

Ars Comb. 60, 313-318 (2001).

E-mail Alert

Add your e-mail address to receive upcoming issues of Ars Combinatoria.

Special Issues

The Combinatorial Press Editorial Office routinely extends invitations to scholars for the guest editing of Special Issues, focusing on topics of interest to the scientific community. We actively encourage proposals from our readers and authors, directly submitted to us, encompassing subjects within their respective fields of expertise. The Editorial Team, in conjunction with the Editor-in-Chief, will supervise the appointment of Guest Editors and scrutinize Special Issue proposals to ensure content relevance and appropriateness for the journal. To propose a Special Issue, kindly complete all required information for submission;