M. Anholcer

collaborators

4 papers

math.CO2025

On acyclic b-chromatic number of cubic graphs

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Let $G$ be a graph. An acyclic $k$ -coloring of $G$ is a map $c : V (G) \to {1, \dots, k}$ such that $c (u) \neq = c (v)$ for any $uv \in E (G)$ and the subgraph induced by the vertice…

math.CO2025

Global coalition sets in graphs

Nazli Besharati, Doost Ali Mojdeh, Mohammad Reza Samadzadeh +1

Let $G = (V, E)$ be a graph. A subset $S \subseteq V$ is called a global dominating set of $G$ , if it serves as a dominating set in both $G$ and its complement $G$ . We defi…

math.CO2025

Mrs. Correct and Majority Colorings

Marcin Anholcer, BartÅomiej Bosek, JarosÅaw Grytczuk +3

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 techn…

math.CO2024

Alon-Tarsi for hypergraphs

Marcin Anholcer, Bartłomiej Bosek, BartÅomiej Bosek +12

Given a hypergraph $H = (V, E)$ , define for every edge $e \in E$ a linear expression with arguments corresponding to the vertices. Next, let the polynomial $p_{H}$ be the product of such…