Extremal Results on Conflict-free Coloring

05/04/2023
by   Shiwali Gupta, et al.
0

A conflict-free open neighborhood coloring of a graph is an assignment of colors to the vertices such that for every vertex there is a color that appears exactly once in its open neighborhood. For a graph G, the smallest number of colors required for such a coloring is called the conflict-free open neighborhood (CFON) chromatic number and is denoted by χ_ON(G). Analogously, we define conflict-free closed neighborhood (CFCN) coloring, and CFCN chromatic number (denoted by χ_CN(G)). First studied in 2002, this problem has received considerable attention. We study the CFON and CFCN coloring problems and show the following results. In what follows, Δdenotes the maximum degree of the graph. 1. For a K_1, k-free graph G, we show that χ_ON(G) = O(k lnΔ). This improves the bound of O(k^2 lnΔ) from [Bhyravarapu, Kalyanasundaram, Mathew, MFCS 2022]. Since χ_CN(G) ≤2χ_ON(G), our result implies an upper bound on χ_CN(G) as well. It is known that there exist separate classes of graphs with χ_ON(G) = Ω(lnΔ) and χ_ON(G) = Ω(k). 2. Let f(δ) be defined as follows: f(δ) = max χ_CN (G) : G is a graph with minimum degree δ. It is easy to see that f(δ') ≥f(δ) when δ' < δ. It is known [Debski and Przybylo, JGT 2021] that f(c Δ) = Θ(logΔ), for any positive constant c. In this paper, we show that f(cΔ^1 - ϵ) = Ω(ln^2 Δ), where c, ϵare positive constants such that ϵ< 0.75. Together with the known upper bound χ_CN(G) = O(ln^2 Δ), this implies that f(cΔ^1 - ϵ) = Θ(ln^2 Δ). 3. For a K_1, k-free graph G on n vertices, we show that χ_CN(G) = O(lnk lnn). This bound is asymptotically tight.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/22/2021

Conflict-free coloring on open neighborhoods of claw-free graphs

The `Conflict-Free Open (Closed) Neighborhood coloring', abbreviated CFO...
research
10/02/2019

Conflict-Free Coloring on Open Neighborhoods

In an undirected graph, a conflict-free coloring (with respect to open n...
research
03/12/2020

Conflict-free coloring on closed neighborhoods of bounded degree graphs

The closed neighborhood conflict-free chromatic number of a graph G, den...
research
12/25/2017

Conflict-free connection of trees

An edge-colored graph G is conflict-free connected if, between each pair...
research
05/01/2019

Parameterized Complexity of Conflict-free Graph Coloring

Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-...
research
02/03/2021

Pliable Index Coding via Conflict-Free Colorings of Hypergraphs

In the pliable index coding (PICOD) problem, a server is to serve multip...
research
12/24/2019

A Brooks-like result for graph powers

Coloring a graph G consists in finding an assignment of colors c: V(G)→{...

Please sign up or login with your details

Forgot password? Click here to reset