DeepAI AI Chat
Log In Sign Up

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

by   Michał Karpiński, et al.
Akademia Sztuk Pięknych we Wrocławiu

In the problem of 2-coloring without monochromatic triangles (or triangle-tree 2-coloring), vertices of the simple, connected, undirected graph are colored with either 'black' or 'white' such that there are no 3 mutually adjacent vertices of the same color. In this paper we are positively answering the question posed in our previous work, namely, if there exists an algorithm solving 2-coloring without monochromatic triangles on planar graphs with linear-time complexity.


page 1

page 2

page 3

page 4


2-distance 4-coloring of planar subcubic graphs with girth at least 21

A 2-distance k-coloring of a graph is a proper vertex k-coloring where v...

Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces

In 1994, Thomassen proved that every planar graph is 5-list-colorable. I...

Balanced Black and White Coloring Problem on knights chessboards

Graph anticoloring problem is partial coloring problem where the main fe...

Explicit 3-colorings for exponential graphs

Let H=(V,E) denote a simple, undirected graph. The 3-coloring exponentia...

3-Coloring in Time O(1.3217^n)

We propose a new algorithm for 3-coloring that runs in time O(1.3217^n)....

All Subgraphs of a Wheel are 5-Coupled-Choosable

A wheel graph consists of a cycle along with a center vertex connected t...

On vertex coloring without monochromatic triangles

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