Volume 38, (2001)

Information Menu
Archive
Research Article

On strongly k-extendable graphs

Ananchuen, N.

J. Comb. Math. Comb. Comput. 38, 3-19 (2001).

Research Article

On c-Bhaskar Rao designs with block size 3 and negative c

Hurd, Spencer P.; Sarvate, Dinesh G.

J. Comb. Math. Comb. Comput. 38, 21-32 (2001).

Research Article

A survey of results on mandatory representation designs

Rees, Rolf S.

J. Comb. Math. Comb. Comput. 38, 33-43 (2001).

Research Article

Presuperschemes and colored directed graphs

Wojdyło, Jerzy

J. Comb. Math. Comb. Comput. 38, 45-54 (2001).

Research Article

On super edge-magic graphs

Chen, Zhibo

J. Comb. Math. Comb. Comput. 38, 55-64 (2001).

Research Article

On F(j)-graphs and their applications

Punnim, Narong

J. Comb. Math. Comb. Comput. 38, 65-72 (2001).

Research Article

On optimal solutions to the problem of gossiping in minimum time

Salerni, Giulio

J. Comb. Math. Comb. Comput. 38, 73-79 (2001).

Research Article

Some k-fold edge-graceful labelings of (p,p−1)-graphs

Shiu, W. C.; Lee, Sin-Min; Schaffer, Karl

J. Comb. Math. Comb. Comput. 38, 81-95 (2001).

Research Article

The isometric path number of a graph

Fisher, David C.; Fitzpatrick, Shannon L.

J. Comb. Math. Comb. Comput. 38, 97-110 (2001).

Research Article

On 2-e. c. line-critical graphs

Bonato, Anthony; Cameron, Kathie

J. Comb. Math. Comb. Comput. 38, 111-121 (2001).

Research Article

A new lemma in Ramsey theory

Hoffman, D. G.; Johnson, P. D. jun.; Szlam, A. D.

J. Comb. Math. Comb. Comput. 38, 123-128 (2001).

Research Article

The spectrum Q(k,λ) of coset difference arrays with k=2λ+1

Chen, K.; Zhu, L.

J. Comb. Math. Comb. Comput. 38, 129-138 (2001).

Research Article

Resolvable designs for resolving disputes

Street, Deborah J.; Wilson, William H.

J. Comb. Math. Comb. Comput. 38, 139-148 (2001).

Research Article

On minimum degree of strongly k-extendable graphs

Ananchuen, N.

J. Comb. Math. Comb. Comput. 38, 149-159 (2001).

Research Article

5-cycle systems of λ(Kv−Ku)

Bryant, Darryn

J. Comb. Math. Comb. Comput. 38, 161-175 (2001).

Research Article

On the counting of caterpillar continua

McClendon, Michael Scott; West, Thelma

J. Comb. Math. Comb. Comput. 38, 177-183 (2001).

Research Article

Symmetric designs, sets with two intersection numbers and Krein parameters of incidence graphs

Martin, William J.

J. Comb. Math. Comb. Comput. 38, 185-196 (2001).

Research Article

On group-magic graphs

Lee, Sinmin; Wen, Ixin; Sun, Hugo

J. Comb. Math. Comb. Comput. 38, 197-207 (2001).

Research Article

An exact and a randomized approach for the satisfiability problem

Drias, H.

J. Comb. Math. Comb. Comput. 38, 209-223 (2001).

Research Article

On classification of 2-(8, 3) and 2-(9, 3) trades

Eslami, Z.; Khosrovshahi, G. B.; Tayfeh-Rezaie, B.

J. Comb. Math. Comb. Comput. 38, 231-242 (2001).

Research Article

Total colorings of some join graphs

Liu, Jiping; Zhao, Cheng

J. Comb. Math. Comb. Comput. 38, 243-252 (2001).

Research Article

Smallest defining sets of some STS(19)

Adams, Peter; Khodkar, Abdollah; Ramsay, Colin

J. Comb. Math. Comb. Comput. 38, 225-230 (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