Poznań University of Economics and Business

output

20112025

most citedGender-Based Homophily in Research: A Large-Scale Study of Man-Woman Collaboration

121 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions

Showing math.COShow all

10 papers · 1 filter

math.CO2022

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.CO2022★ 4 cited

On b-acyclic chromatic number of a graph

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Let $G$ be a graph. We introduce the acyclic b-chromatic number of $G$ as an analogue to the b-chromatic number of $G$ . An acyclic coloring of a graph $G$ is a map $c:V(G)\rightarr…

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…

math.CO2018★ 4 cited

Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs

Marcin Anholcer, Sylwia Cichacz, Jakub Przybyło

We investigate the \textit{group irregularity strength}, $s_{g} (G)$ , of a graph, i.e. the least integer $k$ such that taking any Abelian group $G$ of order $k$ , there exist…

math.CO2017★ 2 cited

Note on group irregularity strength of disconnected graphs

Marcin Anholcer, Sylwia Cichacz, Rafal Jura +1

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

math.CO2015★ 14 cited

Spectra of Graphs and Closed Distance Magic Labelings

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Let $G = (V, E)$ be a graph of order $n$ . A closed distance magic labeling of $G$ is a bijection $ℓ : V (G) \to {1, \dots, n}$ for which there exists a positive intege…

math.CO2012★ 20 cited

Distance magic labeling and two products of graphs

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin +1

Let $G = (V, E)$ be a graph of order $n$ . A distance magic labeling of $G$ is a bijection $ℓ : V \to 1, ..., n$ for which there exists a positive integer $k$ such that…

math.CO2012

Group Irregular Labelings of Disconnected Graphs

Marcin Anholcer, Sylwia Cichacz

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

math.CO2012★ 8 cited

Group Sum Chromatic Number of Graphs

Marcin Anholcer, Sylwia Cichacz

We investigate the \textit{group sum chromatic number} ($\gchi(G)$) of graphs, i.e. the smallest value $s$ such that taking any Abelian group $\gr$ of order $s$ , there exists a fun…

math.CO2012★ 17 cited

Group Irregularity Strength of Connected Graphs

Marcin Anholcer, Sylwia Cichacz, Martin Milanic

We investigate the group irregularity strength ( $s_{g} (G)$ ) of graphs, i.e. the smallest value of $s$ such that taking any Abelian group $\gr$ of order $s$ , there exists a function $…