Pages that link to "Item:Q3312268"
From MaRDI portal
The following pages link to On the decomposition of graphs into complete bipartite subgraphs (Q3312268):
Displaying 33 items.
- Biclique covers and partitions (Q405095) (← links)
- Consensus algorithms for the generation of all maximal bicliques (Q705493) (← links)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices (Q802577) (← links)
- Finding bipartite subgraphs efficiently (Q991744) (← links)
- On the decomposition of graphs into complete bipartite graphs (Q995755) (← links)
- On covering graphs by complete bipartite subgraphs (Q1025967) (← links)
- A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components (Q1078203) (← links)
- Covering a graph by complete bipartite graphs (Q1363672) (← links)
- Edge clique covering sum of graphs (Q1701317) (← links)
- New bounds for the CLIQUE-GAP problem using graph decomposition theory (Q1709587) (← links)
- Decomposition of a graph into two disjoint odd subgraphs (Q1756121) (← links)
- New lower bounds for Hopcroft's problem (Q1816464) (← links)
- Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs (Q1861249) (← links)
- On counting point-hyperplane incidences (Q1873152) (← links)
- On difference graphs and the local dimension of posets (Q1987070) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Decomposing a graph into two subgraphs with prescribed parities of vertex degrees (Q2286313) (← links)
- Bipartite decomposition of random graphs (Q2347851) (← links)
- Bipartite coverings and the chromatic number (Q2380224) (← links)
- New upper bound for sums of dilates (Q2401423) (← links)
- On canonical decomposition of bipartite graphs (Q2741371) (← links)
- Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs (Q2928591) (← links)
- New Bounds for the CLIQUE-GAP Problem Using Graph Decomposition Theory (Q2946384) (← links)
- More on the Bipartite Decomposition of Random Graphs (Q2958197) (← links)
- On the complexity of construction of complete and complete bipartite graphs (Q3184540) (← links)
- A NOTE ON GRAPHS WHOSE DESTRUCTIONS YIELD COMPLETE SUBGRAPHS (Q3491606) (← links)
- On the Decomposition of Graphs (Q3964612) (← links)
- On the minimum number of edge‐disjoint complete <i>m</i>‐partite subgraphs into which <i>K<sub>n</sub></i> can be decomposed (Q4285594) (← links)
- (Q4691855) (← links)
- Sharp bounds for decompositions of graphs into completer-partite subgraphs (Q4879175) (← links)
- Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs (Q5119808) (← links)
- Representation Complexities of SemiAlgebraic Graphs (Q5237912) (← links)
- On Subgraphs of the Complete Bipartite Graph (Q5734986) (← links)
