Pages that link to "Item:Q2928591"
From MaRDI portal
The following pages link to Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs (Q2928591):
Displaying 16 items.
- Successive partition of edges of bipartite graph into matchings (Q502001) (← links)
- On partitioning simple bipartite graphs in vertex-disjoint paths (Q925494) (← links)
- Vertex partition of a complete multipartite graph into two kinds of induced subgraphs (Q973113) (← links)
- Covering graphs with few complete bipartite subgraphs (Q1019181) (← links)
- Partition of a binary matrix into \(k\) (\(k \geq 3\)) exclusive row and column submatrices is difficult (Q1719430) (← links)
- Coherent network partitions (Q2026346) (← links)
- The biclique partitioning polytope (Q2032987) (← links)
- Induced star partition of graphs (Q2161236) (← links)
- Partition of a graph with its complete sub-graphs (Q2915790) (← links)
- (Q3828028) (← links)
- Partitioning a graph into complementary subgraphs (Q5918340) (← links)
- On the generation of bicliques of a graph (Q5919931) (← links)
- Order-sensitive domination in partially ordered sets and graphs (Q6105038) (← links)
- Star covers and star partitions of double-split graphs (Q6124494) (← links)
- On star partition of split graphs (Q6547833) (← links)
- Star covers and star partitions of cographs and butterfly-free graphs (Q6547835) (← links)