Balanced Black and White Coloring Problem on knights chessboards

Graph anticoloring problem is partial coloring problem where the main feature is the opposite rule of the graph coloring problem, i.e., if two vertices are adjacent, their assigned colors must be the same or at least one of them is uncolored. In the same way, Berge in 1972 proposed the problem of placing b black queens and w white queens on a n × n chessboard such that no two queens of different color can attack to each other, the complexity of this problem remains open. In this work we deal with the knight piece under the balance property, since this special case is the most difficult for brute force algorithms.

READ FULL TEXT
research
10/09/2021

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

In the problem of 2-coloring without monochromatic triangles (or triangl...
research
05/04/2023

Coloring tournaments with few colors: Algorithms and complexity

A k-coloring of a tournament is a partition of its vertices into k acycl...
research
09/15/2020

Scatterplot Selection Applying a Graph Coloring Problem

Scatterplot selection is an effective approach to represent essential po...
research
08/10/2022

A Note on the Computational Complexity of Selfmate and Reflexmate Chess Problems

A selfmate is a Chess problem in which White, moving first, needs to for...
research
08/05/2021

Fairer Chess: A Reversal of Two Opening Moves in Chess Creates Balance Between White and Black

Unlike tic-tac-toe or checkers, in which optimal play leads to a draw, i...
research
08/30/2017

The Painter's Problem: covering a grid with colored connected polygons

Motivated by a new way of visualizing hypergraphs, we study the followin...
research
11/24/2010

Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs

Graph coloring, also known as vertex coloring, considers the problem of ...

Please sign up or login with your details

Forgot password? Click here to reset