Conflict-Free Colouring using Maximum Independent Set and Minimum Colouring

12/04/2018
by   S. M. Dhannya, et al.
0

We present a polynomial time reduction from the conflict-free colouring problem in hypergraphs to the maximum independent set problem in simple graphs. Specifically, we show that the conflict-free colouring number of a hypergraph with m hyperedges is k if and only if the simple graph output by the reduction, denoted by G_k, has a maximum independent set of size m. We show that the simple graph resulting from this reduction applied to an interval hypergraph with three disjoint intervals is a perfect graph. Based on this we obtain a polynomial time algorithm to compute a minimum conflict-free colouring of interval hypergraphs, thus solving an open problem due to Cheilaris et al. We also present another characterization of the conflict-free colouring number in terms of the chromatic number of graphs in an associated family of simple graphs. We use this characterization to prove that for an interval hypergraph the conflict-free colouring number is the minimum partition of its intervals into sets such that each set has an exact hitting set (a hitting set in which each interval is hit exactly once).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/24/2021

Vertebrate interval graphs

A vertebrate interval graph is an interval graph in which the maximum si...
research
12/12/2021

Temporal Unit Interval Independent Sets

Temporal graphs have been recently introduced to model changes to a give...
research
02/08/2022

Conflict-free incidence coloring and two-way radio networks

In this paper, we introduce the conflict-free incidence coloring of grap...
research
08/08/2022

A note on independent sets in sparse-dense graphs

Sparse-dense partitions was introduced by Feder, Hell, Klein, and Motwan...
research
09/10/2023

How to assign volunteers to tasks compatibly ? A graph theoretic and parameterized approach

In this paper we study a resource allocation problem that encodes correl...
research
12/02/2017

Nearly Optimal Scheduling of Wireless Ad Hoc Networks in Polynomial Time

In this paper, we address the scheduling problem in wireless ad hoc netw...
research
03/20/2017

Complex Number Formulation and Convex Relaxations for Aircraft Conflict Resolution

We present a novel complex number formulation along with tight convex re...

Please sign up or login with your details

Forgot password? Click here to reset