Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
From MaRDI portal
(Redirected from Publication:2928591)
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25)
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
(21)- Covering graphs with few complete bipartite subgraphs
- Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult
- Coherent network partitions
- The biclique partitioning polytope
- Induced star partition of graphs
- Partition of a graph with its complete sub-graphs
- scientific article; zbMATH DE number 4103104 (Why is no real title available?)
- scientific article; zbMATH DE number 1339492 (Why is no real title available?)
- Computation of the biclique partition number for graphs with specific blocks
- Successive partition of edges of bipartite graph into matchings
- Polynomially solvable cases of the minimum biclique vertex-cover problem
- Clustering minimum biclique completion of a bipartite graph
- Partitioning a graph into complementary subgraphs
- On the generation of bicliques of a graph
- Order-sensitive domination in partially ordered sets and graphs
- Star covers and star partitions of double-split graphs
- Partitioning the edge set of a bipartite graph into the minimal number of subgraphs isomorphic to those of a simple 4 order cycle
- On star partition of split graphs
- Star covers and star partitions of cographs and butterfly-free graphs
- On partitioning simple bipartite graphs in vertex-disjoint paths
- Vertex partition of a complete multipartite graph into two kinds of induced subgraphs
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)
