On the stab number of rectangle intersection graphs

04/18/2018
by   Dibyayan Chakraborty, et al.
0

We introduce the notion of stab number and exact stab number of rectangle intersection graphs, otherwise known as graphs of boxicity at most 2. A graph G is said to be a k-stabbable rectangle intersection graph, or k-SRIG for short, if it has a rectangle intersection representation in which k horizontal lines can be chosen such that each rectangle is intersected by at least one of them. If there exists such a representation with the additional property that each rectangle intersects exactly one of the k horizontal lines, then the graph G is said to be a k-exactly stabbable rectangle intersection graph, or k-ESRIG for short. The stab number of a graph G, denoted by stab(G), is the minimum integer k such that G is a k-SRIG. Similarly, the exact stab number of a graph G, denoted by estab(G), is the minimum integer k such that G is a k-ESRIG. In this work, we study the stab number and exact stab number of some subclasses of rectangle intersection graphs. A lower bound on the stab number of rectangle intersection graphs in terms of its pathwidth and clique number is shown. Tight upper bounds on the exact stab number of split graphs with boxicity at most 2 and block graphs are also given. We show that for k≤ 3, k-SRIG is equivalent to k-ESRIG and for any k≥ 10, there is a tree which is a k-SRIG but not a k-ESRIG. We also develop a forbidden structure characterization for block graphs that are 2-ESRIG and trees that are 3-ESRIG, which lead to polynomial-time recognition algorithms for these two classes of graphs. These forbidden structures are natural generalizations of asteroidal triples. Finally, we construct examples to show that these forbidden structures are not sufficient to characterize block graphs that are 3-SRIG or trees that are k-SRIG for any k≥ 4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/03/2020

Representing graphs as the intersection of cographs and threshold graphs

A graph G is said to be the intersection of graphs G_1,G_2,...,G_k if V(...
research
09/12/2023

The χ-binding function of d-directional segment graphs

Given a positive integer d, the class d-DIR is defined as all those inte...
research
04/03/2023

L_∞ norm minimization for nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and Johnson graphs

We study nowhere-zero integer eigenvectors of the block graphs of Steine...
research
12/14/2022

Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs

Intersection graphs are well-studied in the area of graph algorithms. So...
research
10/09/2020

Succinct Navigational Oracles for Families of Intersection Graphs on a Circle

We consider the problem of designing succinct navigational oracles, i.e....
research
07/17/2019

Containment Graphs, Posets, and Related Classes of Graphs

In this paper, we introduce the notion of the containment graph of a fam...
research
11/12/2021

Moser-Tardos Algorithm: Beyond Shearer's Bound

In a seminal paper (Moser and Tardos, JACM'10), Moser and Tardos develop...

Please sign up or login with your details

Forgot password? Click here to reset