Uniform critical sets in Latin squares
Donavan, Diane; Khodkar, Abdollah
J. Comb. Math. Comb. Comput. 48, 3-23 (2004).
An improved lower bound for g(4)(18)
Grüttmüller, M.; Roberts, I. T.; Stanton, R. G.
J. Comb. Math. Comb. Comput. 48, 25-31 (2004).
Minimum number of bridges on connected almost cubic graphs with given deficiency
Purwanto
J. Comb. Math. Comb. Comput. 48, 33-38 (2004).
On boundary vertices in graphs
Chartrand, Gary; Erwin, David; Johns, Gary L.; Zhang, Ping
J. Comb. Math. Comb. Comput. 48, 39-53 (2004).
Algorithms for the analysis and synthesis of tree structured communication networks
Huizinga, Dorota M.; Kubicka, Ewa
J. Comb. Math. Comb. Comput. 48, 55-88 (2004).
Further investigations on balanced arrays of strength six
Dios, R.; Chopra, D. V.
J. Comb. Math. Comb. Comput. 48, 89-94 (2004).
New 6-dimensional linear codes over GF(8) and GF(9)
Daskalov, Rumen N.; Gulliver, T. Aaron
J. Comb. Math. Comb. Comput. 48, 95-101 (2004).
Vertex-magic cubic graphs
McQuillan, Dan
J. Comb. Math. Comb. Comput. 48, 103-106 (2004).
The covering numbers g(4)3(v)
Stanton, R. G.
J. Comb. Math. Comb. Comput. 48, 107-114 (2004).
Quorum constraints and filters in Boolean lattices
Lonc, Zbigniew; Marek, Victor W.
J. Comb. Math. Comb. Comput. 48, 115-137 (2004).
An extremal problem in distance-k domination
Anderson, Mark S.; Brigham, Robert C.; Carrington, Julie R.; Vitray, Richard P.; Williams, Donna J.; Yellen, Jay
J. Comb. Math. Comb. Comput. 48, 139-156 (2004).
Alliances in graphs
Kristiansen, Petter; Hedetniemi, Sandra M.; Hedetniemi, Stephen T.
J. Comb. Math. Comb. Comput. 48, 157-177 (2004).
Some families of 3-equitable graphs
Bapat, Mukund V.; Limaye, N. B.
J. Comb. Math. Comb. Comput. 48, 179-196 (2004).
Configurations with subset restrictions
Brown, Ezra; Vaughan, Theresa P.
J. Comb. Math. Comb. Comput. 48, 197-215 (2004).
Cutting a graph into small components
Fischermann, Miranca; Rautenbach, Dieter; Volkmann, Lutz
J. Comb. Math. Comb. Comput. 48, 217-222 (2004).




