Work

Mrs. Correct and majority colorings

Year: 2025

Type: article

Abstract: 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.

Source: Discrete Mathematics

DOI: 10.1016/j.disc.2025.114577

Authors: Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski, Jakub Przybyło, Mariusz Zając

Institutions: Poznań University of Economics and Business, Jagiellonian University, Warsaw University of Technology, AGH University of Krakow

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $3,320

Funder: Narodowe Centrum Nauki