On orbital domination numbers of graphs
Chartrand, Gary; Henning, Michael A.; Schultz, Kelly
J. Comb. Math. Comb. Comput. 37, 3-26 (2001).
Integrity of regular graphs and integrity graphs
Atici, Mustafa
J. Comb. Math. Comb. Comput. 37, 27-42 (2001).
Bicyclic decompositions of the complete digraph into each of the orientations of a 4-cycle
Coker, Gary D.; Gardner, Robert B.; Weems, Amy; Torbett, Pam O.
J. Comb. Math. Comb. Comput. 37, 43-52 (2001).
On tree partitions
Dutton, Ronald D.
J. Comb. Math. Comb. Comput. 37, 53-63 (2001).
On expanding the sine function with Catalan numbers: A note on a role for hypergeometric functions
Larcombe, Peter J.; French, David R.
J. Comb. Math. Comb. Comput. 37, 65-74 (2001).
On the character of the matching polynomial and its application to circuit characterization of graphs
Zhao, Hai-Xing; Liu, Ru-Ying
J. Comb. Math. Comb. Comput. 37, 75-86 (2001).
The world’s most interesting class of integral polynomials
Lidl, Rudolf; Mullen, Gary L.
J. Comb. Math. Comb. Comput. 37, 87-100 (2001).
Tenacity-maximum graphs
Choudum, S. A.; Priya, N.
J. Comb. Math. Comb. Comput. 37, 101-114 (2001).
Isomorphism for digraphs and sequences of shop scheduling problems
Bräsel, Heidemarie; Harborth, Martin; Willenius, Per
J. Comb. Math. Comb. Comput. 37, 115-128 (2001).
Existence of HPMDs with block size five and index λ≥2
Bennett, F. E.; Yin, Jianxing
J. Comb. Math. Comb. Comput. 37, 129-137 (2001).
The edge-integrity of some graphs
Kirlangic, Alpay
J. Comb. Math. Comb. Comput. 37, 139-148 (2001).
Graph partitions. II
Porter, Thom; Yang, Bing
J. Comb. Math. Comb. Comput. 37, 149-158 (2001).
On the number of multiplicative partitions of a multi-partite number
Kim, Jun Kyo; Landman, Bruce M.
J. Comb. Math. Comb. Comput. 37, 159-171 (2001).
There are 270,474,142 nonisomorphic 2-(9,4,6) designs
Östergård, Patric R. J.
J. Comb. Math. Comb. Comput. 37, 173-176 (2001).
Graphs where star sets are matched to their complements
Clarke, N. E.; Garraway, W. D.; Hickman, C. A.; Nowakowski, R. J.
J. Comb. Math. Comb. Comput. 37, 177-185 (2001).
An automorphism-free 4-(15, 5, 5) design
Khosrovshahi, G. B.; Maimani, H. R.; Torabi, R.
J. Comb. Math. Comb. Comput. 37, 187-192 (2001).
Self-orthogonal diagonal Latin square with missing subsquare
Du, B.
J. Comb. Math. Comb. Comput. 37, 193-203 (2001).
Combinatorial characterisation of ℓ-optimal authentication codes with arbitration
Wang, Yejing; Safavi-Naini, Reihaneh; Pei, Dingyi
J. Comb. Math. Comb. Comput. 37, 205-224 (2001).
Smallest critical sets for the Latin squares of orders six and seven
Adams, Peter; Khodkar, A.
J. Comb. Math. Comb. Comput. 37, 225-237 (2001).
Abelian Ramanujan graphs
Chen, Kejun
J. Comb. Math. Comb. Comput. 37, 239-250 (2001).
On two conjectures concerning (a,d)-antimagic labellings of antiprisms
Miller, Mirka; Baca, Martin; Lin, Yuqing
J. Comb. Math. Comb. Comput. 37, 251-254 (2001).
