Marcin Anholcer

From MaRDI portal
Person:268263

Available identifiers

zbMath Open anholcer.marcinMaRDI QIDQ268263

List of research outcomes

PublicationDate of PublicationType
Majority choosability of countable graphs2024-01-23Paper
On a problem of Steinhaus2023-12-18Paper
On b-acyclic chromatic number of a graph2023-02-20Paper
Majority dominator colorings of graphs2022-12-28Paper
Mrs. Correct and Majority Colorings2022-07-20Paper
On b-acyclic chromatic number of a graph2022-06-13Paper
https://portal.mardi4nfdi.de/entity/Q50778042022-05-20Paper
Group distance magic and antimagic hypercubes2021-09-30Paper
Total vertex product irregularity strength of graphs2019-12-27Paper
Note on the group edge irregularity strength of graphs2019-11-27Paper
Linear bounds on nowhere-zero group irregularity strength and nowhere-zero group sum chromatic number of graphs2019-11-22Paper
Weight choosability of oriented hypergraphs2019-07-25Paper
Deriving priorities from inconsistent PCM using network algorithms2019-03-06Paper
https://portal.mardi4nfdi.de/entity/Q46824972018-09-18Paper
Note on group irregularity strength of disconnected graphs2018-06-19Paper
Group Irregular Labelings of Disconnected Graphs2017-12-20Paper
Majority choosability of digraphs2017-10-16Paper
The Nonlinear Generalized Transportation Problem with convex costs2017-03-07Paper
Spectra of graphs and closed distance magic labelings2016-04-27Paper
Group sum chromatic number of graphs2016-04-14Paper
Group distance magic labeling of direct product of graphs2016-01-25Paper
Note on distance magic products \(G\circ C_4\)2015-09-24Paper
Distance magic labeling and two products of graphs2015-09-24Paper
https://portal.mardi4nfdi.de/entity/Q29439302015-09-07Paper
Group irregularity strength of connected graphs2015-07-01Paper
Product irregularity strength of certain graphs2014-10-02Paper
Irregular labelings of circulant graphs2012-11-15Paper
A simplified implementation of the least squares solution for pairwise comparisons matrices2012-08-20Paper
Total Vertex Irregularity Strength of Forests2011-03-10Paper
A new upper bound for the total vertex irregularity strength of graphs2009-12-15Paper
Product irregularity strength of graphs2009-12-15Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Marcin Anholcer