No coin nor oath required. For personal study only.
Assaf, A.M., On the covering of pairs by quadruples Behrendt, G., Sharply transitive partially ordered sets Bhaskara Rao, K.P.S., see R. Shelton Bialostocki, A., An application of the Ramsey theorem to ordered r-tournaments (Note) Bienia, W. and H. Meyniel, Partition of digraphs into paths or circuits (Note) Brualdi, R.A. and E.S. Solheid, Maximum determinants of complementary acyclic matrices of zeros and ones Chass6, G., Combinatorial cycles of a polynomial map over a commutative field Cheng, Y., Switching classes of directed graphs and H-equivalent matrices Chvatalova, J. and J. Opatrny, The bandwidth problem and operations on graphs Clark, W.E., Cyclic codes over GF(q) with simple orbit structure Daykin, J.W., Inequalities for the number of monotonic functions of partial orders Delandtsheer, A., Transitivity on sets of independent points in geometric lattices (Communication) Delandtsheer, A., Orbits in uniform hypergraphs (Communication) Fishburn, P.C., F.K. Hwang and H. Lee, Do local majorities force a global majority? Fredricksen, H. and I.J. Kessler, An algorithm for generating necklaces of beads in two colors Gerl, P., Natural spanning trees of 7 d are recurrent (Note) Gill, M.K. and G.A. Patwardhan, Switching invariant two-path signed graphs Goldwasser, J.L., Permanent of the Laplacian matrix of trees with a given matching Gornau, H.-D.O.F. and R. Labahn, An extremal coloring problem on matrices (Communication) Hendry, G.R.T., The size of graphs uniquely hamiltonian-connected from a vertex Heuvers, K.
๐ SIMILAR VOLUMES