Skip to Main content Skip to Navigation
Journal articles

Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs

Abstract : Given a graph and a positive integer k, the biclique vertex-partition problem asks whether the vertex set of the graph can be partitioned into at most k bicliques (connected complete bipartite subgraphs). It is known that this problem is NP-complete for bipartite graphs. In this paper we investigate the computational complexity of this problem in special subclasses of bipartite graphs. We prove that the biclique vertex-partition problem is polynomially solvable for bipartite permutation graphs, bipartite distance-hereditary graphs and remains NP-complete for perfect elimination bipartite graphs and bipartite graphs containing no 4-cycles as induced subgraphs.
Document type :
Journal articles
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, August 31, 2015 - 5:03:21 PM
Last modification on : Thursday, September 7, 2017 - 1:03:41 AM
Long-term archiving on: : Tuesday, December 1, 2015 - 10:42:33 AM


Publisher files allowed on an open archive




Oleg Duginov. Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2014, Vol. 16 no. 3 (3), pp.203--214. ⟨10.46298/dmtcs.2090⟩. ⟨hal-01188904⟩



Record views


Files downloads