Triangle-free and triangle-saturated graphs
Eggleton, Roger B.; MacDougall, James A.
J. Comb. Math. Comb. Comput. 25, 3-21 (1997).
Transitive closure algorithms for causal directed graphs
Gilpin, Michael J.; Shelton, Robert O.
J. Comb. Math. Comb. Comput. 25, 23-32 (1997).
The homomorphism factoring problem
Brewster, R. C.; MacGillivray, G.
J. Comb. Math. Comb. Comput. 25, 33-53 (1997).
Mixed Ramsey numbers: Harmonious chromatic number versus independence number
Moser, David Edwin
J. Comb. Math. Comb. Comput. 25, 55-63 (1997).
A new type of Freeman-Youden rectangle
Preece, D. A.; Phillips, N. C. K.
J. Comb. Math. Comb. Comput. 25, 65-78 (1997).
Stability number of a subclass of chair-free, net-free graphs
Ainouche, Ahmed; Benmeziane, Zineb
J. Comb. Math. Comb. Comput. 25, 79-90 (1997).
Symmetric functions and the theorem of the arithmetic and geometric means
Gasharov, Vesselin
J. Comb. Math. Comb. Comput. 25, 91-95 (1997).
Two-dimensional sequences of primitive polynomials
Park, Bongjoo; Chang, Taejoo; Song, Iickho; Chang, Byung-Hwa
J. Comb. Math. Comb. Comput. 25, 97-111 (1997).
Hamiltonian paths in connected claw-free graphs
Li, Rao
J. Comb. Math. Comb. Comput. 25, 113-119 (1997).
Filling the missing names of towns in a map: A graph theoretic approach
Harary, Frank; Morgana, Aurora; Simeone, Bruno
J. Comb. Math. Comb. Comput. 25, 121-127 (1997).
Monochromatic path covers in nearly complete graphs
Gyárfás, A.; Jagota, A.; Schelp, R. H.
J. Comb. Math. Comb. Comput. 25, 129-144 (1997).
Complete closure and regular factors
Niessen, Thomas
J. Comb. Math. Comb. Comput. 25, 145-160 (1997).
The forcing domination number of a graph
Chartrand, Gary; Gavlas, Heather; Vandell, Robert C.; Harary, Frank
J. Comb. Math. Comb. Comput. 25, 161-174 (1997).
A simple algorithm for generating subsets of k or fewer elements of an n-set
Sabin, R. E.
J. Comb. Math. Comb. Comput. 25, 175-181 (1997).
The algorithmic complexity of perfect neighborhoods in graphs
Hedetniemi, Sandra; Hedetniemi, Stephen T.; Henning, Michael A.
J. Comb. Math. Comb. Comput. 25, 183-192 (1997).
Algorithms for computing grazing area
Gewali, L.; Venkatasubramanian, R.; Glasser, D.
J. Comb. Math. Comb. Comput. 25, 193-211 (1997).
What makes an irredundant set maximal?
Cockayne, E. J.; Grobler, P. J. P.; Hedetniemi, S. T.; McRae, A. A.
J. Comb. Math. Comb. Comput. 25, 213-223 (1997).
Some Ramsey numbers of graphs with bridge
Li, Yusheng
J. Comb. Math. Comb. Comput. 25, 225-229 (1997).
Coverings of the complete directed graph with k-circuits
Kang, Qing-De; Liang, Zhi-He
J. Comb. Math. Comb. Comput. 25, 231-253 (1997).
