An algorithm for enumerating trades in designs, with an application to defining sets
Ramsay, Colin
J. Comb. Math. Comb. Comput. 24, 3-31 (1997).
Weak repetitions in strings
Cummings, L. J.; Smyth, W. F.
J. Comb. Math. Comb. Comput. 24, 33-48 (1997).
A generalized coloring of graphs
Amin, Ashok; Clark, Lane; McSorley, John; Wang, Hui; Zhang, Grant
J. Comb. Math. Comb. Comput. 24, 49-63 (1997).
Distance in graphs: Trees
Entringer, Roger
J. Comb. Math. Comb. Comput. 24, 65-84 (1997).
General probabilistic bounds for dual bin packing heuristics
Hong, Dawei; Leung, Joseph Y.-T.
J. Comb. Math. Comb. Comput. 24, 85-96 (1997).
Graphs of order at most 10 which are critical with respect to the total chromatic number
Hamilton, G. M.; Hilton, A. J. W.; Hind, H. R. F.
J. Comb. Math. Comb. Comput. 24, 97-113 (1997).
Matchings in the leave of equitable partial Steiner triple systems
Raines, M. E.; Rodger, C. A.
J. Comb. Math. Comb. Comput. 24, 115-118 (1997).
Results concerning the automorphism group of the tensor product G⊗Kn
Sanders, Robin Sue; George, John C.
J. Comb. Math. Comb. Comput. 24, 119-127 (1997).
Existence of frame SOLS of type 3nu1
Xu, Yunqing; Lu, Qinglin
J. Comb. Math. Comb. Comput. 24, 129-146 (1997).
On the least deviant path in a graph
Klostermeyer, William F.
J. Comb. Math. Comb. Comput. 24, 147-154 (1997).
Characteristic parameters, chordal graphs, and common neighborhoods
McKee, Terry A.
J. Comb. Math. Comb. Comput. 24, 155-159 (1997).
Large digraphs with small diameter: A voltage assignment approach
Baskoro, Edy Tri; Branković, Ljiljana; Miller, Mirka; Plesník, Ján; Ryan, Joe; Širáň, Jozef
J. Comb. Math. Comb. Comput. 24, 161-176 (1997).
On the number of continua having a finite set of non-cut points
Cropper, Matthew M.
J. Comb. Math. Comb. Comput. 24, 177-184 (1997).
On minimal connected dominating sets
Arseneau, L.; Finbow, A.; Hartnell, B.; Hynick, A.; MacLean, D.; O’Sullivan, L.
J. Comb. Math. Comb. Comput. 24, 185-191 (1997).
On the characterizing properties of the circuit polynomial
Farrell, E. J.; Guo, J. M.
J. Comb. Math. Comb. Comput. 24, 193-200 (1997).
Abelian squares in finite strings
Cummings, L. J.
J. Comb. Math. Comb. Comput. 24, 201-208 (1997).
On a coloring problem of P. Erdős
Horak, Peter
J. Comb. Math. Comb. Comput. 24, 209-211 (1997).
Edge-3-coloring of a family of cubic graphs
Goldwasser, John L.; Zhang, Cun-Quan
J. Comb. Math. Comb. Comput. 24, 213-224 (1997).
Domination in graphs: A brief overview
Haynes, Teresa W.
J. Comb. Math. Comb. Comput. 24, 225-237 (1997).
Hypohamiltonian/hypotraceable digraphs abound
Skupień, Zdzisław
J. Comb. Math. Comb. Comput. 24, 239-242 (1997).
The asymptotic number of Eulerian oriented graphs with multiple edges
Wang, Xiaoji
J. Comb. Math. Comb. Comput. 24, 243-248 (1997).
On two levels balanced arrays of strength six
Chopra, D. V.; Dio’s, R.
J. Comb. Math. Comb. Comput. 24, 249-253 (1997).
