Bipartite Coverings of Graphs
From MaRDI portal
Recommendations
- Bipartite covering graphs
- scientific article; zbMATH DE number 175738
- Coverings of complete bipartite graphs and associated structures
- Covering a graph by complete bipartite graphs
- On covering graphs by complete bipartite subgraphs
- Covering graphs with few complete bipartite subgraphs
- Covering Graphs with Few Complete Bipartite Subgraphs
- On covering a bipartite graph with cycles
- Bipartite graphs and digraphs with equal biclique cover and partition numbers
Cited in
(17)- On covering graphs by complete bipartite subgraphs
- Covering a graph by complete bipartite graphs
- Missing edge coverings of bipartite graphs and the geometry of the Hausdorff metric
- Bipartite coverings and the chromatic number
- On biclique coverings
- The excluded minors for isometric realizability in the plane
- scientific article; zbMATH DE number 3841905 (Why is no real title available?)
- scientific article; zbMATH DE number 5080500 (Why is no real title available?)
- scientific article; zbMATH DE number 4045794 (Why is no real title available?)
- scientific article; zbMATH DE number 68563 (Why is no real title available?)
- scientific article; zbMATH DE number 175738 (Why is no real title available?)
- Biclique covers and partitions
- The lexicographic method for the threshold cover problem
- Bounded-depth succinct encodings and the structure they imply on graphs
- Edge-length preserving embeddings of graphs between normed spaces
- Compact representation of semilinear and terrain-like graphs
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
This page was built for publication: Bipartite Coverings of Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4354593)
