2 papers
math.CO2025
Weak and strong local irregularity of digraphs
Igor Grzelec, Alfréd Onderko, Mariusz Woźniak
Local Irregularity Conjecture states that every simple connected graph, except special cacti, can be decomposed into at most three locally irregular graphs, i.e., graphs in which a…
math.CO2022
Brooks-type theorem for -hued coloring of graphs
Stanislav Jendroľ, Alfréd Onderko
An -hued coloring of a simple graph is a proper coloring of its vertices such that every vertex is adjacent to at least differently colored vertices. T…