M. Zaker

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Improved bounds on the b-chromatic number using the independence and chromatic numbers

Manouchehr Zaker

A b-coloring of a graph $G$ is a proper vertex coloring where each color class contains at least one vertex (a b-vertex) adjacent to a vertex in every other color class. The maximu…

math.CO2024

On z-coloring and $b^{*}$ -coloring of graphs as improved variants of the b-coloring

Manouchehr Zaker

Let $G$ be a simple graph and $c$ a proper vertex coloring of $G$ . A vertex $u$ is called b-vertex in $(G, c)$ if all colors except $c (u)$ appear in the neighborhood of $u$ . By a ${…

math.CO2024

$O (V E)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth

Manouchehr Zaker

The Grundy (or First-Fit) chromatic number of a graph $G = (V, E)$ , denoted by $I^ (G)$ (or $I ¨ _{_{FF}} (G)$ ), is the maximum number of colors used by a First-Fit (greedy) coloring…

Improved bounds on the b-chromatic number using the independence and chromatic numbers

On z-coloring and b∗-coloring of graphs as improved variants of the b-coloring

O(VE) time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth

On z-coloring and $b^{*}$ -coloring of graphs as improved variants of the b-coloring

$O (V E)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth