Graph theoretic and algorithmic aspect of the equitable coloring problem in block graphs

09/27/2020
by   Hanna Furmańczyk, et al.
0

An equitable coloring of a graph G=(V,E) is a (proper) vertex-coloring of G, such that the sizes of any two color classes differ by at most one. In this paper, we consider the equitable coloring problem in block graphs. Recall that the latter are graphs in which each 2-connected component is a complete graph. The problem remains hard in the class of block graphs. In this paper, we present some graph theoretic results relating various parameters. Then we use them in order to trace some algorithmic implications, mainly dealing with the fixed-parameter tractability of the problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/09/2019

On Domination Coloring in Graphs

A domination coloring of a graph G is a proper vertex coloring of G such...
research
01/29/2021

Topological Interference Management with Adversarial Perturbation

In this paper, we consider the topological interference management (TIM)...
research
02/24/2020

Vizing-Goldberg type bounds for the equitable chromatic number of block graphs

An equitable coloring of a graph G is a proper vertex coloring of G such...
research
08/14/2019

Equitable vertex arboricity of d-degenerate graphs

A minimization problem in graph theory so-called the equitable tree-colo...
research
01/17/2019

Hamiltonian chromatic number of block graphs

Let G be a simple connected graph of order n. A hamiltonian coloring c o...
research
03/16/2023

Conflict Optimization for Binary CSP Applied to Minimum Partition into Plane Subgraphs and Graph Coloring

CG:SHOP is an annual geometric optimization challenge and the 2022 editi...
research
10/13/1998

Relaxation in graph coloring and satisfiability problems

Using T=0 Monte Carlo simulation, we study the relaxation of graph color...

Please sign up or login with your details

Forgot password? Click here to reset