Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
From MaRDI portal
Publication:2928591
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)
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
Cited in
(20)- Clustering minimum biclique completion of a bipartite graph
- Order-sensitive domination in partially ordered sets and graphs
- Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
- Partition of a graph with its complete sub-graphs
- Induced star partition of graphs
- Partitioning a graph into complementary subgraphs
- scientific article; zbMATH DE number 4103104 (Why is no real title available?)
- The biclique partitioning polytope
- On star partition of split graphs
- Star covers and star partitions of cographs and butterfly-free graphs
- Coherent network partitions
- On the generation of bicliques of a graph
- Covering graphs with few complete bipartite subgraphs
- Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult
- On partitioning simple bipartite graphs in vertex-disjoint paths
- Computation of the biclique partition number for graphs with specific blocks
- Partitioning the edge set of a bipartite graph into the minimal number of subgraphs isomorphic to those of a simple 4 order cycle
- Successive partition of edges of bipartite graph into matchings
- Star covers and star partitions of double-split graphs
- Polynomially solvable cases of the minimum biclique vertex-cover problem
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)
