MIHAI TALMACIU Department of Mathematics and Informatics,
Faculty of Sciences, "Vasile Alecsandri" University of Bacău,
157 Calea Mărășești, 600115 Bacău, ROMANIA,
e-mail: mtalmaciu@ub.ro
In this paper, using weak-decomposition, we give necessary and sufficient conditions for a graph to be weak-bisplit cograph. We also give we give some applications in optimization problems.
