M. Anholcer

activity

20112025

most citedTotal Vertex Irregularity Strength of Forests

3 citations · 3 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

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

math.CO2020

Majority choosability of countable graphs

Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk

In any vertex coloring of a graph some edges have differently colored ends (\emph{good} edges) and some are monochromatic (\emph{bad} edges). In a proper coloring all edges are goo…

math.CO2019

Total vertex product irregularity strength of graphs

Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh

Consider a simple graph $G$ . We call a labeling $w : E (G) \cup V (G) \to {1, 2, \dots, s}$ (\textit{total vertex}) \textit{product-irregular}, if all product degrees $p d_{G} (v)$ …

math.CO2018

Note on the group edge irregularity strength of graphs

Marcin Anholcer, Sylwia Cichacz

We investigate the \textit{edge group irregularity strength} ( $e s_{g} (G)$ ) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $G$ of order $s$ , th…