The χ-binding function of d-directional segment graphs

09/12/2023
by   Lech Duraj, et al.
0

Given a positive integer d, the class d-DIR is defined as all those intersection graphs formed from a finite collection of line segments in ℝ^2 having at most d slopes. Since each slope induces an interval graph, it easily follows for every G in d-DIR with clique number at most ω that the chromatic number χ(G) of G is at most dω. We show for every even value of ω how to construct a graph in d-DIR that meets this bound exactly. This partially confirms a conjecture of Bhattacharya, Dvořák and Noorizadeh. Furthermore, we show that the χ-binding function of d-DIR is ω↦ dω for ω even and ω↦ d(ω-1)+1 for ω odd. This refutes said conjecture of Bhattacharya, Dvořák and Noorizadeh.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/18/2018

On the stab number of rectangle intersection graphs

We introduce the notion of stab number and exact stab number of rectangl...
research
01/21/2022

Separating polynomial χ-boundedness from χ-boundedness

Extending the idea from the recent paper by Carbonero, Hompe, Moore, and...
research
09/13/2022

Proving a directed analogue of the Gyárfás-Sumner conjecture for orientations of P_4

An oriented graph is a digraph that does not contain a directed cycle of...
research
11/14/2022

On Tuza's conjecture in co-chain graphs

In 1981, Tuza conjectured that the cardinality of a minimum set of edges...
research
08/12/2021

Grounded L-graphs are polynomially χ-bounded

A grounded L-graph is the intersection graph of a collection of "L" shap...
research
02/25/2022

Automorphism Group of Marked Interval Graphs in FPT

An interval graph is the intersection graph of a set of intervals on the...
research
01/10/2023

Contact graphs of boxes with unidirectional contacts

This paper is devoted to the study of particular classes of geometricall...

Please sign up or login with your details

Forgot password? Click here to reset