Fractional biclique covers and partitions of graphs
From MaRDI portal
Publication:2500993
zbMATH Open1096.05043MaRDI QIDQ2500993FDOQ2500993
Publication date: 30 August 2006
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/126408
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cited In (7)
- An overview of graph covering and partitioning
- On the geometric interpretation of the nonnegative rank
- Upper bounds on the Boolean rank of Kronecker products
- Title not available (Why is that?)
- Erdős-Pyber theorem for hypergraphs and secret sharing
- Title not available (Why is that?)
- Clique partitions of distance multigraphs
This page was built for publication: Fractional biclique covers and partitions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2500993)