The complete stability \(cs(P_k)\), where \(P_k\) denotes the property of having a \(k\)-factor, satisfies \(cs(P_k) = n + k – 2, \text{ if } 1 \leq k \leq 3\), and \(n + k – 2 \leq cs(P_k) \leq n + k – 1, \text{ if } k \geq 4\). A similar result for bipartite graphs with complete biclosure is proved also.

It is known that in every 2-coloring of the edges of the complete graph there exist two vertex disjoint paths—one red, one blue—that collectively cover all the vertices. In this paper, analogous existence and efficiency questions are examined when edges are missing from the complete graph. The main result shows the existence of a path cover when at most \(\left\lfloor{n}/{2}\right\rfloor\) edges are missing. An example shows this result is sharp. A second result shows that a path cover can be found efficiently if a matching is missing.

A map shows only the names of some (but not all) towns in a region. If for each town, the names of all neighboring towns are known, when is it possible to reconstruct from this information the missing names? We deal with a generalization of this problem to arbitrary graphs. For a graph \(G = (V, E)\) with \(n\) nodes, we give an \(O(n^3)\) algorithm to recognize those instances for which the answer is YES, as well as two characterization theorems: NO-instances are determined by the existence of a certain partition of \(V\) and YES-instances by the existence of a suitable weak order in \(V\).

Let \(G\) be a connected claw-free graph of order \(n\). If \(G \not\in M\) and the minimum degree of \(G\) is at least \(\frac{n}{4}\), then \(G\) is traceable.Here, \(M\) is a set of graphs such that each element in \(M\) can be decomposed into three disjoint subgraphs \(G_1\), \(G_2\), \(G_3\) and \(E_G(G_i, G_j) = u_iu_j\), here \(1 \leq i, j \leq 3\) and \(u_i \in G_i\), \(1\leq i \leq 3\).

In this paper, we consider the two-dimensional sequence of primitive polynomials, which is defined by two positive integers and a primitive polynomial. The concept of \(q^m\) conjugate order is used to describe the two-dimensional sequence. Using the two-dimensional sequences, we can find maximum period primitive-polynomial sequences for more values of degrees than using the one-dimensional sequences. Examples of the applications of the two-dimensional sequence by computer search are shown.

We show that results analogous to the theorem of the arithmetic and geometric means hold for the three multiplicative fundamental bases of the vector space of symmetric functions – the elementary symmetric functions, the homogeneous symmetric functions, and the power sum symmetric functions. We give examples to demonstrate that no such results hold for the two non-multiplicative fundamental bases – the Schur functions and the monomial symmetric functions.

We describe a class of graphs \(\Gamma\) for which the stability number can be obtained in polynomial time. A graph in class \(\Gamma\) is chair-free, net-free, and has the property that the claw-centers form an independent set.

A Freeman-Youden rectangle (FYR) is a Graeco-Latin row-column design consisting of a balanced superimposition of two Youden squares. There are well-known infinite series of FYRs of sizes \(q \times (2q + 1)\) and \((q+1) \times (2q+1)\), where \( (2q+1) \) is a prime power congruent to 3 (modulo 4). Any member of these series is readily constructed from an initial column whose entries are specified very simply in terms of powers of a primitive root of GF\((2q + 1)\).We now show that, for \(q \geq 9\), initial columns for FYRs of the above sizes can be specified more generally, which allows us to obtain many more FYRs, which are unlike any that have previously appeared in the literature. We present enumerations for \(q = 9\) and \(q = 11\), and we tabulate new FYRs for these values of \(q\). We also present some new FYRs for \(q = 15\).

The harmonious chromatic number of a graph \(G\), denoted \(h(G)\), is the smallest number of colors needed to color the vertices of \(G\) so that adjacent vertices receive different colors and no two edges have the same pair of colors represented at their endvertices.The mixed harmonious Ramsey number \(H(a, b)\) is defined to be the smallest integer \(p\) such that if a graph \(G\) has \(p\) vertices, then either \(h(G) \geq a\) or \(\alpha(G) \geq b\). For certain values of \(a\) and \(b\), we determine the exact value of \(H(a,b)\). In some other cases, we are able to determine upper and lower bounds for \(H(a, b)\).

Let \(H\) and \(Y\) be fixed digraphs, and let \(h\) be a fixed homomorphism of \(H\) to \(Y\). The \emph{Homomorphism Factoring Problem with respect} to \((H, h, Y)\) is described as follows:
\(\text{HFP}(H, h, Y)\)
INSTANCE: A digraph \(G\) and a homomorphism \(g\) of \(G\) to \(Y\).
QUESTION: Does there exist a homomorphism \(f\) of \(G\) to \(H\) such that \(h \circ f = g\)? That is, can the given homomorphism \(g\) be factored into the composition of \(h\) and some homomorphism \(f\) of \(G\) to \(H\)?We investigate the complexity of this problem and show that it differs from that of the \(H\)-colouring problem, i.e., the decision problem “is there a homomorphism of a given digraph \(G\) to the fixed digraph \(H\)?”, and of restricted versions of this problem. We identify directed graphs \(H\) for which any homomorphism factoring problem involving \(h\) is solvable in polynomial time. By contrast, we prove that for any fixed undirected graph \(Y\) which is not a path on at most four vertices, there exists a fixed undirected graph \(H\), which can be chosen to be either a tree or a cycle, and a fixed homomorphism \(h\) of \(H\) to \(Y\) such that \(\text{HFP}(H, h, Y)\) is NP-complete, and if \(Y\) is such a path then \(\text{HFP}(H, h, Y)\) is polynomial.