Biclique Graphs of K3-free Graphs and Bipartite Graphs

@article{Groshaus2021BicliqueGO,
  title={Biclique Graphs of K3-free Graphs and Bipartite Graphs},
  author={Marina Groshaus and Andr{\'e} Luiz Pires Guedes},
  journal={ArXiv},
  year={2021},
  volume={abs/2006.00040}
}
View PDF on arXiv
View With Semantic Reader

Figures from this paper

References

SHOWING 1-10 OF 23 REFERENCES
Almost every graph is divergent under the biclique operator
Distances between bicliques and structural properties of bicliques in graphs
TLDR
This work gives a useful formula that relates the distance between bicliques in a graph $G$ and thedistance between their respectives vertices in $KB(G)$.
Biclique graphs of interval bigraphs
Biclique graphs and biclique matrices
TLDR
A characterization of biclique matrices is described, in similar terms as those employed in Gilmore's characterization of clique matrices.
On the Iterated Biclique Operator
TLDR
A forbidden structure characterization of convergent graphs, which yield a polynomial time algorithm to decide if a given graph diverges or converges under the biclique operator.
The number of convergent graphs under the biclique operator with no twin vertices is finite
The clique operator on circular-arc graphs
On clique divergent graphs with linear growth
Efficient Mining of Large Maximal Bicliques
TLDR
This paper proposes an efficient algorithm to mine large maximal biclique subgraphs from undirected graphs using a divide-and-conquer approach and shows that the proposed algorithm outperforms previous work significantly.
Clique graphs of Helly circular arc graphs
TLDR
A characterization theorem of clique graphs of Helly circular-arc graphs is presented and it is proved that this subclass of circular-ARC graphs is contained in the intersection between proper circular- Arc graphs, clique-Helly circular-Arc graphs and Helly circles.
...
...