66 citations · 323 across the 55 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DM2012
Set graphs. II. Complexity of set graph recognition and similar problems
Martin Milanič, Romeo Rizzi, Alexandru I. Tomescu
A graph is said to be a `set graph' if it admits an acyclic orientation that is also `extensional', in the sense that the out-neighborhoods of its vertices are pairwise distinc…
math.CO2012★ 17 cited
Group Irregularity Strength of Connected Graphs
Marcin Anholcer, Sylwia Cichacz, Martin Milanic
We investigate the group irregularity strength () of graphs, i.e. the smallest value of such that taking any Abelian group $\gr$ of order , there exists a function $…