Volume LXV, October, 2002

Research Article

New series of Dudeney sets for \(p+2\) vertices

Kobayashi, Midori; Mutoh, Nobuaki; Kiyasu-Zen’iti; Nakamura, Gisaku

Ars Comb. 65, 3-20 (2002).

Research Article

Radio labelings of cycles

Zhang, Ping

Ars Comb. 65, 21-32 (2002).

Research Article

On the number of graphical forest partitions

Frank, Deborah A.; Savage, Carla D.; Sellers, James A.

Ars Comb. 65, 33-37 (2002).

Research Article

Which graphs have Hall number two

ohnson, P. D. jun.; Wantland, E. B.

Ars Comb. 65, 39-64 (2002).

Research Article

Self-complementary graphs with minimum degree two

Ando, Kiyoshi; Nakamoto, Atsuhiro

Ars Comb. 65, 65-74 (2002).

Research Article

On the analysis of an algorithm to generate a random cyclic permutation

Prodinger, Helmut

Ars Comb. 65, 75-78 (2002).

Research Article

On full orthogonal designs in order 56

Georgiou, S.; Koukouvinos, C.; Seberry, Jennifer

Ars Comb. 65, 79-89 (2002).

Research Article

New linear codes of dimensions 5 and 6 over \(GF(8)\)

Gulliver, T. Aaron

Ars Comb. 65, 91-96 (2002).

Research Article

4-circulant graphs

Davis, George J.; Domke, Gayla S.; Garner, Charles R. jun.

Ars Comb. 65, 97-110 (2002).

Research Article

On the existence of aperiodic perfect maps for \(2\times 2\) windows

Kim, Sang-Mok

Ars Comb. 65, 111-120 (2002).

Research Article

Realizability of \(p\)-point, \(q\)-line graphs with prescribed minimum degree and line connectivity

DiMarco, D.

Ars Comb. 65, 121-128 (2002).

Research Article

Inducing regularization of graphs, multigraphs and pseudographs

Górska, Joanna; Skupień, Zdzisław

Ars Comb. 65, 129-133 (2002).

Research Article

Remarks on a general model of a random digraph

Jaworski, Jerzy; Palka, Zbigniew

Ars Comb. 65, 135-144 (2002).

Research Article

Note on directed odd or even minimum \((s,t)\)-cut problem and generalizations

Fülöp, Ottilia

Ars Comb. 65, 145-147 (2002).

Research Article

Some properties of two-color partitions

Robbins, Neville

Ars Comb. 65, 149-154 (2002).

Research Article

On harmonious graphs of order 6

Seoud, M. A.; Youssef, M. Z.

Ars Comb. 65, 155-176 (2002).

Research Article

On harmonious labelings of some cycle related graphs

Martin Klazar, Wild,peter R.

Ars Comb. 65, 155-176 (2002).

Research Article

Bishop covers of rectangular boards

Fisher, David C.; Thalos, Paul

Ars Comb. 65, 199-208 (2002).

Research Article

Minimal 4-equitability of \(C_{2n}OK_ 1\)

Acharya, Manisha; Bhat-Nayak, Vasanti N.

Ars Comb. 65, 209-236 (2002).

Research Article

The spectra for two classes of graph designs

Deb, Parag K.; Limaye, N. B.

Ars Comb. 65, 237-243 (2002).

Research Article

Embeddings of Steiner quadruple systems

Liu, Chester W. J.; Wild, Peter R.

Ars Comb. 65, 245-250 (2002).

Research Article

New determinantal identities on Stirling numbers

Chandramouli, B. S.

Ars Comb. 65, 251-263 (2002).

Research Article

Algorithmic aspects of counting independent sets

Jou, Min-Jen; Chang, Gerard J.

Ars Comb. 65, 265-277 (2002).

Research Article

Avoidable sets in groups

Develin, Mike

Ars Comb. 65, 279-297 (2002).

Research Article

On embedding partial unitals and large \((k,n)\)-arcs

Hadnagy, Éva; Szőnyi, Tamás

Ars Comb. 65, 299-308 (2002).

Research Article

Excess problem for modular lattices

Abe, Tetsuya

Ars Comb. 65, 309-318 (2002).

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;