Enregistré dans:
Détails bibliographiques
Auteurs principaux: Anholcer, Marcin, Bosek, Bartłomiej, Grytczuk, Jarosław, Gutowski, Grzegorz, Przybyło, Jakub, Zając, Mariusz
Format: Preprint
Publié: 2022
Sujets:
Accès en ligne:https://arxiv.org/abs/2207.09739
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866909620396621824
author Anholcer, Marcin
Bosek, Bartłomiej
Grytczuk, Jarosław
Gutowski, Grzegorz
Przybyło, Jakub
Zając, Mariusz
author_facet Anholcer, Marcin
Bosek, Bartłomiej
Grytczuk, Jarosław
Gutowski, Grzegorz
Przybyło, Jakub
Zając, Mariusz
contents A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techniques and generalize previously known results on various generalizations of majority coloring. In particular, our unified and simplified approach works for paintability - an on-line analog of the list coloring.
format Preprint
id arxiv_https___arxiv_org_abs_2207_09739
institution arXiv
publishDate 2022
record_format arxiv
spellingShingle Mrs. Correct and Majority Colorings
Anholcer, Marcin
Bosek, Bartłomiej
Grytczuk, Jarosław
Gutowski, Grzegorz
Przybyło, Jakub
Zając, Mariusz
Combinatorics
A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techniques and generalize previously known results on various generalizations of majority coloring. In particular, our unified and simplified approach works for paintability - an on-line analog of the list coloring.
title Mrs. Correct and Majority Colorings
topic Combinatorics
url https://arxiv.org/abs/2207.09739