On the linear vertex-arboricity of a surface
Hara, Masao; Ohyama, Yoshiyuki; Yamashita, Satoshi
J. Comb. Math. Comb. Comput. 18, 3-10 (1995).
An algorithm for the factorization of permutations on a tree
Vaughan, Theresa P.; Portier, Frederick J.
J. Comb. Math. Comb. Comput. 18, 11-31 (1995).
Two cyclic supplementary difference sets and optimal designs in linear models
Chadjiconstantinidis, Stathis; Chadjipadelis, Theodore; Sotirakoglou, Kiki
J. Comb. Math. Comb. Comput. 18, 33-56 (1995).
A note on intersecting cliques in Cayley graphs
Hahn, Geňa; Širáň, Jozef
J. Comb. Math. Comb. Comput. 18, 57-63 (1995).
Existence of Room frames of type 2nu1
Ge, G.; Zhu, L.
J. Comb. Math. Comb. Comput. 18, 65-82 (1995).
Complete sets of pairwise orthogonal latin squares of order 9
Owens, P. J.; Preece, D. A.
J. Comb. Math. Comb. Comput. 18, 83-96 (1995).
A heuristic bandwidth reduction algorithm
Dueck, Gerhard W.; Jeffs, Janice
J. Comb. Math. Comb. Comput. 18, 97-108 (1995).
Ranks of trees and grid graphs
Bevis, Jean H.; Domke, Gayla S.; Miller, Valerie A.
J. Comb. Math. Comb. Comput. 18, 109-119 (1995).
On unitary Cayley graphs
Dejter, Italo J.; Giudici, Reinaldo E.
J. Comb. Math. Comb. Comput. 18, 121-124 (1995).
A note on the coloring of a certain class of graphs
Guan, Puhua; Huang, Tayuan
J. Comb. Math. Comb. Comput. 18, 125-127 (1995).
On the additive bandwidth of graphs
Bascuñán, M. E.; Ruiz, S.; Brigham, R. C.; Caron, R. M.; Slater, P. J.; Vitray, R. P.
J. Comb. Math. Comb. Comput. 18, 129-144 (1995).
Graphs with dense constant neighbourhoods
Fronček, Dalibor
J. Comb. Math. Comb. Comput. 18, 145-150 (1995).
Clique decompositions of strong short ladders
Farrell, E. J.; Sam Chee, M. A.
J. Comb. Math. Comb. Comput. 18, 151-160 (1995).
On certain combinatorial arrays
Chopra, D. V.; Dioś, R.
J. Comb. Math. Comb. Comput. 18, 161-166 (1995).
Another construction for the (25, 4, 1) design
Stanton, R. G.; Kroeker, D. W.
J. Comb. Math. Comb. Comput. 18, 167-169 (1995).
Note on Williamson matrices of orders 25 and 37
Đoković, Dragomir Ž.
J. Comb. Math. Comb. Comput. 18, 171-175 (1995).
Some new results on (g,f)-factorizations of graphs
Guiying, Yan
J. Comb. Math. Comb. Comput. 18, 177-185 (1995).
Complete (k−1)-subgraphs of k-critical graphs
Su, Xiang-Ying
J. Comb. Math. Comb. Comput. 18, 186-192 (1995).
On covering designs with block size 5 and index 7
Assaf, Ahmad M.
J. Comb. Math. Comb. Comput. 18, 193-213 (1995).
Scheduling with communication delays
Saad, Rachid
J. Comb. Math. Comb. Comput. 18, 214-224 (1995).
Denumerants and their approximations
Lisoněk, Petr
J. Comb. Math. Comb. Comput. 18, 225-232 (1995).
Relating pairs of distance domination parameters
Henning, Michael A.; Oellermann, Ortrud R.; Swart, Henda C.
J. Comb. Math. Comb. Comput. 18, 233-244 (1995).
Total chromatic number of graphs of high maximum degree
Chew, K. H.
J. Comb. Math. Comb. Comput. 18, 245-254 (1995).
