Biclique covers and partitions
From MaRDI portal
Publication:405095
zbMath1300.05259arXiv1307.6363MaRDI QIDQ405095
Publication date: 4 September 2014
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1307.6363
Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (9)
An overview of graph covering and partitioning ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ Three ways to cover a graph ⋮ Finding biclique partitions of co-chordal graphs ⋮ Edge clique covering sum of graphs ⋮ Biclique cover and local clique cover of graphs ⋮ Erdős-Pyber theorem for hypergraphs and secret sharing ⋮ Coherent network partitions: characterizations with cographs and prime graphs ⋮ Coherent network partitions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- On the decomposition of graphs into complete bipartite graphs
- On covering graphs by complete bipartite subgraphs
- Bipartite dimensions and bipartite degrees of graphs
- On the coverings of graphs
- A mathematical analysis of human leukocyte antigen serology
- Covering a graph by complete bipartite graphs
- Bipartite coverings and the chromatic number
- Graph Theory and Probability
- On set intersection representations of graphs
- On the decomposition ofkn into complete bipartite graphs
- Topics in Intersection Graph Theory
- Bipartite Coverings of Graphs
- Communication Complexity
- Turán and Ramsey Properties of Subcube Intersection Graphs
- On the Addressing Problem for Loop Switching
This page was built for publication: Biclique covers and partitions
