Skip to search formSkip to main contentSkip to account menu

Defective coloring

In graph theory, a mathematical discipline, coloring refers to an assignment of colours or labels to vertices, edges and faces of a graph. Defective… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
In Defective Coloring we are given a graph G = (V,E) and two integers χd,∆ and are asked if we can partition V into χd color… 
2018
2018
The gap between the known randomized and deterministic local distributed algorithms underlies arguably the most fundamental and… 
1995
1995
A graph is (k; d)-colorable if one can color the vertices with k colors such that no vertex is adjacent to more than d vertices…