Fractional biclique covers and partitions of graphs

MaRDI QIDQ2500993zbMATH OpenFDO

Authors Valerie L. Watts

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, http://www.emis.de/journals/EJC/Volume_13/Abstracts/v13i1r74.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

Boolean rankweak product

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Bipartite graphs and digraphs with equal biclique cover and partition numbers
• scientific article; zbMATH DE number 1439493
• Computation of the biclique partition number for graphs with specific blocks
• Biclique covers and partitions
• scientific article; zbMATH DE number 2170465

Cited in

(8)

• On the geometric interpretation of the nonnegative rank
• An overview of graph covering and partitioning
• Upper bounds on the Boolean rank of Kronecker products
• scientific article; zbMATH DE number 5011088 (Why is no real title available?)
• scientific article; zbMATH DE number 4045794 (Why is no real title available?)
• Erdős-Pyber theorem for hypergraphs and secret sharing
• Clique partitions of distance multigraphs
• A set coverage problem

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)