M. Anholcer

activity

20112025

most citedDistance magic labeling and two products of graphs

20 citations · 99 across the 20 of their papers we have counts for

collaborators

Showing 2025Show all

3 papers · 1 filter

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

Alon-Tarsi for hypergraphs

Marcin Anholcer, Bartłomiej Bosek, Grzegorz Gutowski +6

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…