Volume 39, (2001)

Information Menu
Archive
Research Article

Some initial results on the supermagicness of regular complete k-partite graphs

Ho, Yong-Song; Lee, Sin-Min

J. Comb. Math. Comb. Comput. 39, 3-17 (2001).

Research Article

Between packable and arbitrarily packable graphs: Packer-spoiler games

Goddard, Wayne; Kubicki, Grzegorz

J. Comb. Math. Comb. Comput. 39, 19-32 (2001).

Research Article

A combinatorial interpretation of Bessel polynomials and their first derivatives as ordered hit polynomials

McSorley, John P.; Feinsilver, Philip

J. Comb. Math. Comb. Comput. 39, 33-48 (2001).

Research Article

A new algorithm for computer searches for orthogonal designs

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

J. Comb. Math. Comb. Comput. 39, 49-63 (2001).

Research Article

On-line scheduling to maximize task completions

Baruah, Sanjoy; Haritsa, Jayant; Sharma, Nitin

J. Comb. Math. Comb. Comput. 39, 65-78 (2001).

Research Article

Nearly Kirkman triple systems of order 18

Mathon, Rudolf; Rosa, A.

J. Comb. Math. Comb. Comput. 39, 79-91 (2001).

Research Article

λ-fold K2,5-designs

Hoffman, Dean G.; Kirkpatrick, Kimberly S.; Raines, Michael E.

J. Comb. Math. Comb. Comput. 39, 93-106 (2001).

Research Article

Special super edge magic labelings of bipartite graphs

Muntaner-Batle, F. A.

J. Comb. Math. Comb. Comput. 39, 107-120 (2001).

Research Article

On networks with maximum graphical structure and tenacity T

Moazzami, Dara

J. Comb. Math. Comb. Comput. 39, 121-126 (2001).

Research Article

i-connectivity in a generalized hypercube

Lawson, Linda M.; Boland, James W.; Ringeisen, Richard D.

J. Comb. Math. Comb. Comput. 39, 127-137 (2001).

Research Article

On a relationship between 2-dominating and 5-dominating sets in graphs

Chen, Guantao; Jacobson, Michael S.

J. Comb. Math. Comb. Comput. 39, 139-145 (2001).

Research Article

A new non-asymptotic upper bound for snake-in-the-box codes

Lukito, A.; van Zanten, A. J.

J. Comb. Math. Comb. Comput. 39, 147-156 (2001).

Research Article

The metric dimension and metric independence of a graph

Currie, James; Oellermann, Ortrud R.

J. Comb. Math. Comb. Comput. 39, 157-167 (2001).

Research Article

Randomness in heuristics: An experimental investigation for the maximum satisfiability problem

Drias, H.

J. Comb. Math. Comb. Comput. 39, 169-181 (2001).

Research Article

Decompositions of uniform complete directed multigraphs into each of the orientations of a 4-cycle

Chapman, Gene; Gardner, Robert

J. Comb. Math. Comb. Comput. 39, 183-201 (2001).

Research Article

Optimal packings and coverings of λDKv

Kang, Qingde; Liang, Zhihe

J. Comb. Math. Comb. Comput. 39, 203-253 (2001).

E-mail Alert

Add your e-mail address to receive upcoming issues of Journal of Combinatorial Mathematics and Combinatorial Computing (JCMCC).
Submit Manuscript

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;
Propose a Special Issue

News & Announcements