3 papers
math.CO2026
Locally Irregular Total Colorings of Graphs
Anna FlaszczyÅska, Aleksandra Gorzkowska, Igor Grzelec +2
A total graph is an ordered triple , where are the sets of empty and full vertices, respectively, , and the set of edges is…
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.CO2024
On Local Irregularity Conjecture for 2-multigraphs
Igor Grzelec, Alfréd Onderko, Mariusz Woźniak
A multigraph in which adjacent vertices have different degrees is called locally irregular. The locally irregular edge coloring is an edge coloring of a multigraph in which eve…