Bipartite Coverings of Graphs
From MaRDI portal
Publication:4354593
DOI10.1017/S0963548397003064zbMATH Open0894.05022OpenAlexW2130631679MaRDI QIDQ4354593FDOQ4354593
Authors: Vojtěch Rödl, Andrzej Ruciński 
Publication date: 29 July 1998
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548397003064
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 (14)
- Title not available (Why is that?)
- Bounded-depth succinct encodings and the structure they imply on graphs
- Title not available (Why is that?)
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- The lexicographic method for the threshold cover problem
- Title not available (Why is that?)
- On covering graphs by complete bipartite subgraphs
- On biclique coverings
- Biclique covers and partitions
- Title not available (Why is that?)
- Bipartite coverings and the chromatic number
- Missing edge coverings of bipartite graphs and the geometry of the Hausdorff metric
- The excluded minors for isometric realizability in the plane
- Title not available (Why is that?)
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)
