Abstract. Chromatic number, chromatic sum and chromatic sum number are important graph coloring characteristics. The paper proves that a parallel metaheuristic like the parallel ge...
A total perfect code in a graph is a subset of the graph's vertices with the property that each vertex in the graph is adjacent to exactly one vertex in the subset. We prove t...
Ghidewon Abay-Asmerom, Richard Hammack, Dewey T. T...
Abstract. In this paper, we address the problem of computing a maximum-size subgraph of a P4-sparse graph which admits a perfect matching; in the case where the graph has a perfect...
In this paper we show that, if G is a Berge graph such that neither G nor its complement G contains certain induced subgraphs, named proper wheels and long prisms, then either G i...
ABSTRACT. The maximum independent set problem (MAXIS) on general graphs is known to be NPhard to approximate within a factor of n1-, for any > 0. However, there are many "...
Venkatesan T. Chakaravarthy, Vinayaka Pandit, Samb...