Recent advances in DNA sequencing technology and their focal role in Genome Wide
Association Studies (GWAS) have rekindled a growing interest in the whole-genome …

It is known that the n-dimensional bubble-sort graph Bn is bipartite,(n− 1)-regular, and has n!
vertices. We first show that, for any vertex v, Bn− v has a hamiltonian path between any two …

We consider a variant of the path cover problem, namely, the k-fixed-endpoint path cover
problem, or k PC for short, on interval graphs. Given a graph G and a subset T of k vertices of …

This paper addresses the problem of scheduling jobs on flow shops subject to constraints
given by an undirected graph, in which each edge joins a pair of conflicting jobs that cannot …

Covering problems belong to the foundation of graph theory. There are several types of
covering problems in graph theory such as covering the vertex set by stars (domination …

The n-dimensional hypercube network Qn is one of the most popular interconnection
networks since it has simple structure and is easy to implement. The n-dimensional …

This paper addresses the problem of scheduling, on a two-machine flow shop, a set of unit-
time operations subject to the constraints that some conflicting jobs cannot be scheduled …

The problem presented in this paper is a generalization of the usual coupled-tasks
scheduling problem in presence of compatibility constraints. The reason behind this study is …

A path cover of a graph G=(V, E) is a set of pairwise vertex-disjoint paths such that the
disjoint union of the vertices of these paths equals the vertex set V of G. The path cover …

In this paper, we study a variant of the path cover problem, namely, the k‐fixed‐endpoint
path cover problem. Given a graph G and a subset \calT of k vertices of V (G), ak‐fixed …