Volume 36, (2001)

Information Menu
Archive
Research Article

Support sizes of indecomposable threefold triple systems

Lo Faro, G.; Shen, H.

J. Comb. Math. Comb. Comput. 36, 3-29 (2001).

Research Article

Some arithmetic properties of Eulerian numbers

Knopfmacher, Arnold; Robbins, Neville

J. Comb. Math. Comb. Comput. 36, 31-42 (2001).

Research Article

Some friends of Alltop’s designs 4-(2f+1,5,5)

Bierbrauer, Jürgen

J. Comb. Math. Comb. Comput. 36, 43-53 (2001).

Research Article

Non-existence of a nested BIB design NB(10, 15, 2, 3)

Hishida, Takaaki; Ishikawa, Kengo; Jimbo, Masakazu; Kageyama, Sanpei; Kuriki, Shinji

J. Comb. Math. Comb. Comput. 36, 55-63 (2001).

Research Article

STS-graphical invariant for perfect codes

Dejter, I. J.

J. Comb. Math. Comb. Comput. 36, 65-79 (2001), Corrigendum 38, 253-254 (2001).

Research Article

The forcing hull number of a graph

Chartrand, Gary; Zhang, Ping

J. Comb. Math. Comb. Comput. 36, 81-94 (2001).

Research Article

Gray codes for involutions

Walsh, Timothy

J. Comb. Math. Comb. Comput. 36, 95-118 (2001).

Research Article

Two new 1-rotational (36, 9, 8) and (40, 10, 9) RBIBDs

Morales, Luis B.

J. Comb. Math. Comb. Comput. 36, 119-126 (2001).

Research Article

Minimal and maximal e=1 functions

Dankelmann, P.; Erwin, D. J.; Fricke, G.; Goddard, W.; Swart, H. C.

J. Comb. Math. Comb. Comput. 36, 127-138 (2001).

Research Article

Clique representations and dimension-k chordal graphs

McKee, Terry A.

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

Research Article

A sufficient condition for pancyclic graphs

Balogh, Ferenc

J. Comb. Math. Comb. Comput. 36, 149-154 (2001).

Research Article

Isomorphisms involving reversing arcs of digraphs

Chen, Guantao; Hall, Frank J.; Kezdy, Andre E.; Li, Zhongshan; Zhou, Huishan

J. Comb. Math. Comb. Comput. 36, 155-160 (2001).

Research Article

Concerning the number of edges in a graph with diameter constraints

Caccetta, Louis; Hartman, Irith Ben-Arroyo; Huang, Jing

J. Comb. Math. Comb. Comput. 36, 161-173 (2001).

Research Article

Minimum distance bounds for linear codes over GF(7)

Daskalov, Rumen N.; Gulliver, T. Aaron

J. Comb. Math. Comb. Comput. 36, 175-191 (2001).

Research Article

Some investigations on orthogonal arrays

Chopra, D. V.; Dios, R.

J. Comb. Math. Comb. Comput. 36, 193-200 (2001).

Research Article

On the Nordhaus-Gaddum problem for the edge cost of a graph

Cook, R. J.

J. Comb. Math. Comb. Comput. 36, 201-206 (2001).

Research Article

Two-tuples weight enumerators

Baartmans, Alphonse; Yorgov, Vassil

J. Comb. Math. Comb. Comput. 36, 207-214 (2001).

Research Article

Forbidden graphs and irredundant perfect graphs

Puech, Joël

J. Comb. Math. Comb. Comput. 36, 215-228 (2001).

Research Article

Antimagic face labeling of convex polytopes based on biprisms

Bača, Martin; Miller, Mirka

J. Comb. Math. Comb. Comput. 36, 229-236 (2001).

Research Article

Alternative proofs of three theorems of Chetwynd and Hilton

Yap, H. P.; Song, Z. X.

J. Comb. Math. Comb. Comput. 36, 237-246 (2001).

Research Article

The equitable edge-colouring of outerplanar graphs

Wu, Jian-Liang

J. Comb. Math. Comb. Comput. 36, 247-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