It is proven that for every fixed h, a and b, a graph with n vertices and minimum degree at least h-1 h n, which contains no copy of Kb (the complete graph with b vertices), conta...
: In the complete graph K2m+3 for m 2, we study some structures of simple non-isomorphic Hamiltonian sub-graphs of the form H ( 2m+3 , 6m+3) for m 2 . The various structures of t...
In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with appl...
Kreweras’ conjecture [9] asserts that every perfect matching of the hypercube Qd can be extended to a Hamiltonian cycle of Qd. We [5] proved this conjecture but here we present ...
We prove that the exact versions of the domatic number problem are complete for the levels of the boolean hierarchy over NP. The domatic number problem, which arises in the area of...