Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1301.05262
author: Oleg Duginov
publication date: 2014-11-10T00:00:00Z
full work available at URL: 0.html
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C60
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 6367139
zbMATH Keywords: bicliques
zbMATH Keywords: bipartite graph
zbMATH Keywords: computational complexity
zbMATH Keywords: partitioning problem
MaRDI profile type: Publication
Recommended article: Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
Recommended article: Partition of a graph with its complete sub-graphs
Recommended article: On vertex-disjoint complete bipartite subgraphs in a bipartite graph
Recommended article: Q3312268
Recommended article: Partitioning a graph into complementary subgraphs
Recommended article: On biclique partitions of the complete graph
Recommended article: On the bipartition of graphs
Recommended article: On Subgraphs of the Complete Bipartite Graph
Recommended article: Bipartization of graphs
title: Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
published in: Discrete Mathematics and Theoretical Computer Science. DMTCS
description: scientific article; zbMATH DE number 6367139