DeepAI AI Chat
Log In Sign Up

On vertex coloring without monochromatic triangles

by   Michał Karpiński, et al.

We study a certain relaxation of the classic vertex coloring problem, namely, a coloring of vertices of undirected, simple graphs, such that there are no monochromatic triangles. We give the first classification of the problem in terms of classic and parametrized algorithms. Several computational complexity results are also presented, which improve on the previous results found in the literature. We propose the new structural parameter for undirected, simple graphs -- the triangle-free chromatic number χ_3. We bound χ_3 by other known structural parameters. We also present two classes of graphs with interesting coloring properties, that play pivotal role in proving useful observation about our problem. We give/ask several conjectures/questions throughout this paper to encourage new research in the area of graph coloring.


page 1

page 2

page 3

page 4


Polynomial Cases for the Vertex Coloring Problem

The computational complexity of the Vertex Coloring problem is known for...

Graph colorings under global structural conditions

More than ten years ago in 2008, a new kind of graph coloring appeared i...

Linear-time algorithm for vertex 2-coloring without monochromatic triangles on planar graphs

In the problem of 2-coloring without monochromatic triangles (or triangl...

Relaxation in graph coloring and satisfiability problems

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

Structural Parameterizations for Equitable Coloring

An n-vertex graph is equitably k-colorable if there is a proper coloring...

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness

Domination and coloring are two classic problems in graph theory. The ma...

Solving the List Coloring Problem through a Branch-and-Price algorithm

In this work, we present a branch-and-price algorithm to solve the weigh...