Biclique Graphs of K_3-free Graphs and Bipartite Graphs

05/29/2020
by   Marina Groshaus, et al.
0

A biclique of a graph is a maximal complete bipartite subgraph. The biclique graph of a graph G, KB(G), defined as the intersection graph of the bicliques of G, 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 K_3-free graph G. We prove that KB(G) is the square graph of a particular graph which we call Mutually Included Biclique Graph of G (KB_m(G)). Although it does not lead to a polynomial time recognition algorithm, it gives a new tool to prove properties of biclique graphs (restricted to K_3-free graphs) using known properties of square graphs. For instance we generalize a property about induced P_3's in biclique graphs to a property about stars and proved a conjecture posted by Groshaus and Montero, when restricted to K_3-free graphs. Also we characterize the class of biclique graphs of bipartite graphs. We prove that KB(bipartite) = (IIC-comparability)^2, where IIC-comparability is a subclass of comparability graphs that we call Interval Intersection Closed Comparability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/15/2021

Finding Efficient Domination for (S_1,2,5,S_3,3,3-Free Chordal Bipartite Graphs in Polynomial Time

A vertex set D in a finite undirected graph G is an efficient dominating...
research
03/09/2022

Minimal obstructions for polarity, monopolarity, unipolarity and (s,1)-polarity in generalizations of cographs

Every hereditary property can be characterized by finitely many minimal ...
research
08/03/2018

Searching for square-complementary graphs: non-existence results and complexity of recognition

A graph is square-complementary (squco, for short) if its square and com...
research
07/28/2020

Injective hulls of various graph classes

A graph is Helly if its disks satisfy the Helly property, i.e., every fa...
research
12/14/2018

Graph classes and forbidden patterns on three vertices

This paper deals with graph classes characterization and recognition. A ...
research
02/19/2019

On the dualization in distributive lattices and related problems

In this paper, we study the dualization in distributive lattices, a gene...
research
09/09/2019

Strongly chordal digraphs and Γ-free matrices

We define strongly chordal digraphs, which generalize strongly chordal g...

Please sign up or login with your details

Forgot password? Click here to reset