Hardness and structural results for half-squares of restricted tree convex bipartite graphs

04/16/2018
by   Hoang-Oanh Le, et al.
0

Let B=(X,Y,E) be a bipartite graph. A half-square of B has one color class of B as vertex set, say X; two vertices are adjacent whenever they have a common neighbor in Y. Every planar graph is a half-square of a planar bipartite graph, namely of its subdivision. Until recently, only half-squares of planar bipartite graphs, also known as map graphs (Chen, Grigni and Papadimitriou [STOC 1998, J. ACM 2002]), have been investigated, and the most discussed problem is whether it is possible to recognize these graphs faster and simpler than Thorup's O(n^120)-time algorithm (Thorup [FOCS 1998]). In this paper, we identify the first hardness case, namely that deciding if a graph is a half-square of a balanced bisplit graph is NP-complete. (Balanced bisplit graphs form a proper subclass of star convex bipartite graphs.) For classical subclasses of tree convex bipartite graphs such as biconvex, convex, and chordal bipartite graphs, we give good structural characterizations of their half-squares that imply efficient recognition algorithms. As a by-product, we obtain new characterizations of unit interval graphs, interval graphs, and of strongly chordal graphs in terms of half-squares of biconvex bipartite, convex bipartite, and of chordal bipartite graphs, respectively. Good characterizations of half-squares of star convex and star biconvex bipartite graphs are also given, giving linear-time recognition algorithms for these half-squares.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/10/2018

Map graphs having witnesses of large girth

A half-square of a bipartite graph B=(X,Y,E_B) has one color class of B ...
research
07/20/2021

Steiner Tree in k-star Caterpillar Convex Bipartite Graphs – A Dichotomy

The class of k-star caterpillar convex bipartite graphs generalizes the ...
research
02/25/2023

Cosecure Domination: Hardness Results and Algorithm

For a simple graph G=(V,E) without any isolated vertex, a cosecure domin...
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
08/06/2021

Complexity of Restricted Star Colouring

Restricted star colouring is a variant of star colouring introduced to d...
research
10/30/2021

Characterization of the Imbalance Problem on Complete Bipartite Graphs

We study the imbalance problem on complete bipartite graphs. The imbalan...
research
10/16/2018

On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms

Detecting dense subgraphs from large graphs is a core component in many ...

Please sign up or login with your details

Forgot password? Click here to reset