An obvious necessary condition for the existence of an almost resolvable \(B(k,k-1;v)\) is \(v \equiv 1 \pmod{k}\). We show in this paper that the necessary condition is also sufficient for \(k = 5\) or \(k = 6\), possibly excepting \(8\) values of \(v\) when \(k = 5\) and \(3\) values of \(v\) when \(k = 6\).

This paper gives two sufficient conditions for a \(2\)-connected graph to be pancyclic. The first one is that the degree sum of every pair of nonadjacent vertices should not be less than \(\frac{n}{2} + \delta\). The second is that the degree sum of every triple of independent vertices should not be less than \(n + \delta\), where \(n\) is the number of vertices and \(\delta\) is the minimum degree of the graph.

In this paper we will consider the Ramsey numbers for paths and cycles in graphs with unordered as well as ordered vertex sets.

Suppose that \(R = (V, A)\) is a diregular bipartite tournament of order \(p \geq 8\). Denote a cycle of length \(k\) by \(C_k\). Then for any \(e \in A(R)\), \(w \in V(R) \setminus V(e)\), there exists a pair of vertex-disjoint cycles \(C_4\) and \(C_{p-4}\) in \(R\) with \(e \in C_4\) and \(w \in C_{p-4}\), except \(R\) is isomorphic to a special digraph \(\tilde{F}_{4k}\).

We construct all four-chromatic triangle-free graphs on twelve vertices, and a triangle-free, uniquely three-colourable graph.

Let \(K\) be a maximal block of a graph \(G\) and let \(x\) and \(y\) be two nonadjacent vertices of \(G\). If \(|V(X)| \leq \frac{1}{2}(n+3)\) and \(x\) and \(y\) are not cut vertices, we show that \(x\) is not adjacent to \(y\) in the closure \(c(G)\) of \(G\). We also show that, if \(x, y \notin V(K)\), then \(x\) is not adjacent to \(y\) in \(c(G)\).

We give necessary and sufficient conditions for the existence of 2-colorable \(G\)-designs for each \(G\) that is connected, simple and has at most 5 edges.

In this paper we examine the existence problem for cyclic Mendelsohn quadruple systems (briefly CMQS) and we prove that a CMQS of order \(v\) exists if and only if \(v \equiv 1 \pmod{4}\). Further we study the maximum number \(m_a(v)\) of pairwise disjoint (on the same set) CMQS’s of order \(v\) each having the same \(v\)-cycle as an automorphism. We prove that, for every \(v \equiv 1 \pmod{4}\), \(2v-8 \leq m_4(v) \leq v^2 – 11v + z\), where \(z = 32\) if \(v \equiv 1\) or \(5 \pmod{12}\) and \(z = 30\) if \(v \equiv 9 \pmod{12}\), and that \(m_4(5) = 2\), \(m_4(9) = 12\), \(50 \leq m_4(13) \leq 58\).