3 citations · 3 across the 1 of their papers we have counts for
3 papers
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 . We call a labeling (\textit{total vertex}) \textit{product-irregular}, if all product degrees …
math.CO2011★ 3 cited
Total Vertex Irregularity Strength of Forests
Marcin Anholcer, Michał Karoński, Florian Pfender
We investigate a graph parameter called the total vertex irregularity strength (), i.e. the minimal such that there is a labeling $w: E(G)\cup V(G)\rightarrow \{1,2,..,…