An algorithm for balanced flows
Kocay, William; Stone, Doug
J. Comb. Math. Comb. Comput. 19, 3-31 (1995).
Strongly connected mixed graphs and connected detachments of graphs
Nash-Williams, C. St. J. A.
J. Comb. Math. Comb. Comput. 19, 33-47 (1995).
Codes from Hadamard matrices and profiles of Hadamard matrices. II
Lin, Cantian; Lin, Haiping
J. Comb. Math. Comb. Comput. 19, 48-54 (1995).
Permutation graphs: Hamiltonian paths
Riedesel, Charles; Deogun, Jitender S.
J. Comb. Math. Comb. Comput. 19, 55-63 (1995).
Graphs with geometric properties
Shult, Ernest E.
J. Comb. Math. Comb. Comput. 19, 65-92 (1995).
A few more Z-cyclic whist tournaments
Finizio, Norman J.
J. Comb. Math. Comb. Comput. 19, 93-95 (1995).
An algorithm to find the upper bound of the distance between graphs
Wang, Ping; Dueck, Gerhard W.
J. Comb. Math. Comb. Comput. 19, 97-107 (1995).
Forbidden subgraphs and cycle extendability
Faudree, Ralph; Ryjáček, Zdeněk; Schiermeyer, Ingo
J. Comb. Math. Comb. Comput. 19, 109-128 (1995).
A hundred years of whist tournaments
Anderson, I.
J. Comb. Math. Comb. Comput. 19, 129-150 (1995).
Total colouring of hypergraphs
Cowling, Peter
J. Comb. Math. Comb. Comput. 19, 151-160 (1995).
The existence of interval-balanced tournament designs
Rodney, P.
J. Comb. Math. Comb. Comput. 19, 161-170 (1995).
Some algorithms for the computer display of geometric constructions in the real projective plane
Kocay, William; Tiessen, Don
J. Comb. Math. Comb. Comput. 19, 171-191 (1995).
Optimal algorithms for stabbing polygons by monotone chains and paths
Estivill-Castro, Vladimir; Schuierer, Sven
J. Comb. Math. Comb. Comput. 19, 193-206 (1995).
Six MOLS of order 76
Colbourn, Charles J.; Yin, J.; Zhu, L.
J. Comb. Math. Comb. Comput. 19, 207-208 (1995).
Cliques in hypergraphs and mutual exclusion using tokens
Ordman, Edward T.
J. Comb. Math. Comb. Comput. 19, 209-224 (1995).
A note on periodic complementary binary sequences
Lin, Cantian; Selfridge, J. L.; Shiue, Peter Jau-Shyong
J. Comb. Math. Comb. Comput. 19, 225-229 (1995).
A combinatorial queueing model related to the ballot problem
Boneh, Shahar; Papanicolaou, Vassilis G.
J. Comb. Math. Comb. Comput. 19, 231-244 (1995).
On generating large binary linear error-correcting codes
Sabin, R. E.
J. Comb. Math. Comb. Comput. 19, 245-258 (1995).
A note on Y-Δ and Δ-Y graphs
Gardner, L. Leslie; Del Greco, John G.
J. Comb. Math. Comb. Comput. 19, 259-272 (1995).
Heuristics for minimizing total flow time with error constraint
Leung, Joseph Y.-T.; Tam, Tommy W.; Wong, C. S.
J. Comb. Math. Comb. Comput. 19, 273-295 (1995).
Almost regular robust graphs for arbitrary number of nodes
Srimani, Pradip K.; Sur, Sumit
J. Comb. Math. Comb. Comput. 19, 297-313 (1995).
A direct proof of a theorem on detachments of finite graphs
Nash-Williams, C. St. J. A.
J. Comb. Math. Comb. Comput. 19, 314-318 (1995).
