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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2020

Steinberg-type graphs, those planar graphs containing no 4-cycles or 5-cycles, became well known with the 1976 Steinberg…

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

The gap between the known randomized and deterministic local distributed algorithms underlies arguably the most fundamental and…

2016

A graph coloring is an assignment of labels called “colors” to certain elements of a graph subject to certain constraints. The…

2015

2014

A graph G has an equitable k-defective coloring in m colors if its vertices can be colored with m colors such that the maximum…

2009

The distributed (Δ + 1)-coloring problem is one of the most fundamental and wellstudied problems in distributed algorithms…

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…