Tag - Coloring

Fractional coloring with local demands Wed, Mar 27, 2019 12:30 CET

Speakers: Tom Kelly

In a fractional coloring, vertices of a graph are assigned subsets of the [0, 1]-interval such that adjacent vertices receive disjoint subsets. The fractional chromatic number of a graph is at most k if it admits a fractional coloring in which the amount of "color" assigned to each vertex is at least 1/k. We investigate fractional colorings where vertices "demand" different amounts of color, determined by local parameters such as the degree of a vertex.

Coloring Jordan regions and Jordan curves Wed, Nov 22, 2017 12:00 CET

Speakers: Wouter Cames van Batenburg

Fine-grained complexity of coloring unit disks and balls Wed, Oct 4, 2017 12:30 CEST

Speakers: Till Miltzow

Coloring graphs with no short cycles Wed, Mar 1, 2017 12:30 CET

Speakers: Nathan Meynaert