Biclique Graphs of $K_3$-free Graphs and Bipartite Graphs
Marina Groshaus, Andr\'e Luiz Pires Guedes

TL;DR
This paper characterizes the biclique graphs of $K_3$-free graphs and bipartite graphs, providing new tools and properties to understand their structure, including a characterization as square graphs of a new graph class.
Contribution
It introduces a characterization of biclique graphs of $K_3$-free graphs as square graphs of a new graph class and characterizes biclique graphs of bipartite graphs as squares of IIC-comparability graphs.
Findings
Biclique graph of $K_3$-free graphs is the square of $KB_m(G)$.
Biclique graphs of bipartite graphs are squares of IIC-comparability graphs.
Generalizes properties about induced ${P_3}$s to stars in biclique graphs.
Abstract
A biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph , , defined as the intersection graph of the bicliques of , was introduced and characterized in 2010. However, this characterization does not lead to polynomial time recognition algorithms. The time complexity of its recognition problem remains open. There are some works on this problem when restricted to some classes. In this work we give a characterization of the biclique graph of a -free graph . We prove that is the square graph of a particular graph which we call Mutually Included Biclique Graph of (). Although it does not lead to a polynomial time recognition algorithm, it gives a new tool to prove properties of biclique graphs (restricted to -free graphs) using known properties of square graphs. For instance we generalize a property about…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
