The biclique covering number of grids
From MaRDI portal
Publication:2335697
zbMATH Open1427.05174arXiv1811.03396MaRDI QIDQ2335697FDOQ2335697
Tony Huynh, Krystal Guo, Marco Macchia
Publication date: 15 November 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Abstract: We determine the exact value of the biclique covering number for all grid graphs.
Full work available at URL: https://arxiv.org/abs/1811.03396
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- On biclique coverings
- Biclique covers and partitions
- The domination number of grids
- Publication:4933930
- On biclique covering number of the Cartesian product of graphs
- The connected domination number of grids
- scientific article; zbMATH DE number 4053683
- scientific article; zbMATH DE number 4031723
- On the biclique cover of the complete graph
- On perfect coverings of two-dimensional grids
Cites Work
- A mathematical analysis of human leukocyte antigen serology
- Title not available (Why is that?)
- On the Addressing Problem for Loop Switching
- Applications of matrix methods to the theory of lower bounds in computational complexity
- A short proof that the extension complexity of the correlation polytope grows exponentially
- Title not available (Why is that?)
- Bipartite dimensions and bipartite degrees of graphs
- On biclique coverings
- Nearly Tight Approximability Results for Minimum Biclique Cover and Partition
- Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
- Extension complexity of stable set polytopes of bipartite graphs
- Biclique cover and local clique cover of graphs
Cited In (4)
Uses Software
This page was built for publication: The biclique covering number of grids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2335697)
