Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
zbMATH Open1301.05262MaRDI QIDQ2928591FDOQ2928591
Authors: Oleg Duginov 
Publication date: 10 November 2014
Published in: Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/2379/0.html
Recommendations
- Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
- Partition of a graph with its complete sub-graphs
- On vertex-disjoint complete bipartite subgraphs in a bipartite graph
- scientific article; zbMATH DE number 3841905
- Partitioning a graph into complementary subgraphs
- Partitioning a graph into complementary subgraphs
- On biclique partitions of the complete graph
- On the bipartition of graphs
- On Subgraphs of the Complete Bipartite Graph
- Bipartization of graphs
Analysis of algorithms and problem complexity (68Q25) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (19)
- Order-sensitive domination in partially ordered sets and graphs
- Computation of the biclique partition number for graphs with specific blocks
- Polynomially solvable cases of the minimum biclique vertex-cover problem
- Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
- Covering graphs with few complete bipartite subgraphs
- On the generation of bicliques of a graph
- Partition of a graph with its complete sub-graphs
- Coherent network partitions
- The biclique partitioning polytope
- Induced star partition of graphs
- Partitioning a graph into complementary subgraphs
- Clustering minimum biclique completion of a bipartite graph
- Successive partition of edges of bipartite graph into matchings
- On partitioning simple bipartite graphs in vertex-disjoint paths
- Star covers and star partitions of double-split graphs
- Title not available (Why is that?)
- On star partition of split graphs
- Star covers and star partitions of cographs and butterfly-free graphs
- Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult
This page was built for publication: Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2928591)
