Key points are not available for this paper at this time.
The canonical decomposition of a bipartite graph is a new decomposition method that involves three operators: parallel, series, and K⨁ S. The class of weak-bisplit graphs is the class of totally decomposable graphs with respect to these operators, and the class of bicographs is the class of totally decomposable graphs with respect to parallel and series operators. We prove in this paper that the class of bipartite (P6,C6)-free graphs is the class of bipartite graphs that are totally decomposable with respect to parallel and K⨁S operators. We present a linear time recognition algorithm for (P6,C6)-free graphs that is symmetrical to the linear recognition algorithms of weak-bisplit graphs and star1,2,3-free bipartite graphs. As a result of this algorithm, we present efficient solutions in this class of graphs for two optimization graph problems: the maximum balanced biclique problem and the maximum independent set problem.
Quaddoura et al. (Sun,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: