scientific article; zbMATH DE number 3841905
From MaRDI portal
Publication:3312268
Recommendations
Cited in
(39)- On covering graphs by complete bipartite subgraphs
- A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components
- Covering a graph by complete bipartite graphs
- Edge clique covering sum of graphs
- New bounds for the CLIQUE-GAP problem using graph decomposition theory
- Decomposition of a graph into two disjoint odd subgraphs
- New lower bounds for Hopcroft's problem
- Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs
- On counting point-hyperplane incidences
- On difference graphs and the local dimension of posets
- An overview of graph covering and partitioning
- Decomposing a graph into two subgraphs with prescribed parities of vertex degrees
- Bipartite decomposition of random graphs
- Bipartite coverings and the chromatic number
- New upper bound for sums of dilates
- On canonical decomposition of bipartite graphs
- Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
- New bounds for the CLIQUE-GAP problem using graph decomposition theory
- More on the bipartite decomposition of random graphs
- On the complexity of construction of complete and complete bipartite graphs
- The bigraph decomposition number of a graph
- A NOTE ON GRAPHS WHOSE DESTRUCTIONS YIELD COMPLETE SUBGRAPHS
- On the Decomposition of Graphs
- Biclique covers and partitions
- On the minimum number of edge‐disjoint complete m‐partite subgraphs into which Kn can be decomposed
- Problems and invariants connected with bicliques and multicliques of graphs
- Sharp bounds for decompositions of graphs into completer-partite subgraphs
- Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs
- Representation complexities of semialgebraic graphs
- On Subgraphs of the Complete Bipartite Graph
- Decomposition of random graphs into complete bipartite graphs
- Semi-algebraic off-line range searching and biclique partitions in the plane
- Consensus algorithms for the generation of all maximal bicliques
- Semi-algebraic off-line range searching and biclique partitions in the plane
- On Zarankiewicz's problem for intersection hypergraphs of geometric objects
- Compact representation of semilinear and terrain-like graphs
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- Finding bipartite subgraphs efficiently
- On the decomposition of graphs into complete bipartite graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3312268)
