On bicliques, biclique partitions and related classes of cographs

MaRDI QIDQ4642250zbMATH OpenFDO

Authors Mihai Talmaciu

Publication date 22 May 2018

zbMATH Keywords

attack graphbiclique cover\(P_4\)-free graphsbiclique partitioncombinatorial optimization numbers

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Bicliques in graphs. I: Bounds on their number
• Hereditary biclique-Helly graphs: recognition and maximal biclique enumeration
• Finding biclique partitions of co-chordal graphs
• Biclique graph of bipartite permutation graphs
• Biclique graphs and biclique matrices

Cited in

(4)

• Regarding two conjectures on clique and biclique partitions
• Coherent network partitions: characterizations with cographs and prime graphs
• On the termination of some biclique operators on multipartite graphs
• On bicliques and the second clique graph of suspensions

This page was built for publication: On bicliques, biclique partitions and related classes of cographs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4642250)