research
∙
05/27/2023
On Locally Identifying Coloring of Cartesian Product and Tensor Product of Graphs
For a positive integer k, a proper k-coloring of a graph G is a mapping ...
share
research
∙
04/06/2023
Parameterized algorithms for Eccentricity Shortest Path Problem
Given an undirected graph G=(V,E) and an integer ℓ, the Eccentricity Sho...
research
∙
11/22/2022
On Structural Parameterizations of Star Coloring
A Star Coloring of a graph G is a proper vertex coloring such that every...
research
∙
12/22/2021
Conflict-free coloring on open neighborhoods of claw-free graphs
The `Conflict-Free Open (Closed) Neighborhood coloring', abbreviated CFO...
research
∙
05/18/2021
Conflict-Free Coloring: Graphs of Bounded Clique Width and Intersection Graphs
Given an undirected graph, a conflict-free coloring (CFON*) is an assign...
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
∙
10/02/2019
Conflict-Free Coloring on Open Neighborhoods
In an undirected graph, a conflict-free coloring (with respect to open n...
research
∙
02/10/2018
