# A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs

A b-coloring of a graph G is a proper coloring of its vertices such that each color class contains a vertex that has at least one neighbor in all the other color classes. The b-chromatic number of a graph G, denoted by χ_b(G), is the maximum number k such that G admits a b-coloring with k colors. We consider the complexity of the problem of deciding whether a graph G has a b-coloring with k colors, whenever the value of k is close to one of two upper bounds on χ_b(G): The maximum degree Δ(G) plus one, and the m-degree, denoted by m(G), which is defined as the maximum number i such that G has i vertices of degree at least i-1. We obtain a dichotomy result stating that for fixed k ∈{Δ(G) + 1 - p, m(G) - p}, the problem is polynomial-time solvable whenever p ∈{0, 1} and, even when k = 3, it is NP-complete whenever p > 2. We furthermore give an FPT-algorithm parameterized by k + ℓ, where ℓ denotes the number of vertices of degree at least k, while we observe that the problem is NP-complete whenever k is unbounded and ℓ = 0.

• 22 publications
• 20 publications
research
02/02/2023

### More results on the z-chromatic number of graphs

By a z-coloring of a graph G we mean any proper vertex coloring consisti...
research
08/09/2021

### Two-Class (r,k)-Coloring: Coloring with Service Guarantees

This paper introduces the Two-Class (r,k)-Coloring problem: Given a fixe...
research
03/19/2018

### Swapping Colored Tokens on Graphs

We investigate the computational complexity of the following problem. We...
research
03/24/2021

### The Multicolored Graph Realization Problem

We introduce the Multicolored Graph Realization problem (MGRP). The inpu...
research
11/17/2021

### Evolutionary Algorithm for Graph Coloring Problem

The graph coloring problem (GCP) is one of the most studied NP-HARD prob...
research
01/03/2023

### Quantum Feasibility Labeling for NP-complete Vertex Coloring Problem

Many important science and engineering problems can be converted into NP...
research
01/31/2023

### New bounds and constructions for neighbor-locating colorings of graphs

A proper k-coloring of a graph G is a neighbor-locating k-coloring if fo...