Marcin Anholcer

According to our database, Marcin Anholcer authored at least 21 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Majority choosability of countable graphs.

Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk

Eur. J. Comb., March, 2024

2023

On b-acyclic chromatic number of a graph.

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Comput. Appl. Math., February, 2023

2021

Group distance magic and antimagic hypercubes.

Marcin Anholcer, Sylwia Cichacz, Dalibor Froncek, Rinovia Simanjuntak, Jiangyi Qiu

Discret. Math., 2021

2019

Weight choosability of oriented hypergraphs.

Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk

Ars Math. Contemp., 2019

Deriving priorities from inconsistent PCM using network algorithms.

Marcin Anholcer, János Fülöp

Ann. Oper. Res., 2019

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

Marcin Anholcer, Sylwia Cichacz, Jakub Przybylo

Appl. Math. Comput., 2019

Note on the group edge irregularity strength of graphs.

Marcin Anholcer, Sylwia Cichacz

Appl. Math. Comput., 2019

2017

Majority Choosability of Digraphs.

Marcin Anholcer, Bartlomiej Bosek, Jaroslaw Grytczuk

Electron. J. Comb., 2017

Group Irregular Labelings of Disconnected Graphs.

Marcin Anholcer, Sylwia Cichacz

Contributions Discret. Math., 2017

2016

Group sum chromatic number of graphs.

Marcin Anholcer, Sylwia Cichacz

Eur. J. Comb., 2016

Spectra of graphs and closed distance magic labelings.

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin

Discret. Math., 2016

2015

Group irregularity strength of connected graphs.

Marcin Anholcer, Sylwia Cichacz, Martin Milanic

J. Comb. Optim., 2015

Distance Magic Labeling and Two Products of Graphs.

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh

Graphs Comb., 2015

Note on Distance Magic Products G ∘ C₄.

Marcin Anholcer, Sylwia Cichacz

Graphs Comb., 2015

Group distance magic labeling of direct product of graphs.

Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh

Ars Math. Contemp., 2015

2014

Product irregularity strength of certain graphs.

Marcin Anholcer

Ars Math. Contemp., 2014

2012

Irregular labelings of circulant graphs.

Marcin Anholcer, Cory Palmer

Discret. Math., 2012

Optimization of Supply Chain via Reduction of Complaints Ratio.

Marcin Anholcer, Arkadiusz Kawa

Proceedings of the Agent and Multi-Agent Systems. Technologies and Applications, 2012

2011

A simplified implementation of the least squares solution for pairwise comparisons matrices.

Marcin Anholcer, Volodymyr Babiy, Sándor Bozóki, Waldemar W. Koczkodaj

Central Eur. J. Oper. Res., 2011

2009

A new upper bound for the total vertex irregularity strength of graphs.

Marcin Anholcer, Maciej Kalkowski, Jakub Przybylo

Discret. Math., 2009

Product irregularity strength of graphs.

Marcin Anholcer

Discret. Math., 2009