DeepAI AI Chat
Log In Sign Up

3-Coloring in Time O(1.3217^n)

by   Lucas Meijer, et al.

We propose a new algorithm for 3-coloring that runs in time O(1.3217^n). For this algorithm, we make use of the time O(1.3289^n) algorithm for 3-coloring by Beigel and Eppstein. They described a structure in all graphs, whose vertices could be colored relatively easily. In this paper, we improve upon this structure and present new ways to determine how the involved vertices reduce the runtime of the algorithm.


page 1

page 2

page 3

page 4


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

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

A Linear Algorithm for Minimum Dominator Colorings of Orientations of Paths

In this paper we present an algorithm for finding a minimum dominator co...

Optimal Distributed Coloring Algorithms for Planar Graphs in the LOCAL model

In this paper, we consider distributed coloring for planar graphs with a...

Local Coloring and its Complexity

A k-coloring of a graph is an assignment of integers between 1 and k to ...

Discrepancy Minimization in Input-Sparsity Time

A recent work of Larsen [Lar23] gave a faster combinatorial alternative ...

Computing the Chromatic Number Using Graph Decompositions via Matrix Rank

Computing the smallest number q such that the vertices of a given graph ...

On vertex coloring without monochromatic triangles

We study a certain relaxation of the classic vertex coloring problem, na...