42 citations · 120 across the 18 of their papers we have counts for
Showing 2014 · math.COShow all
2 papers · 2 filters
math.CO2014★ 9 cited
On the complexity of deciding whether the regular number is at most two
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
The regular number of a graph G denoted by reg(G) is the minimum number of subsets into which the edge set of G can be partitioned so that the subgraph induced by each subset is re…
math.CO2014★ 2 cited
Sigma Partitioning: Complexity and Random Graphs
Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi
A of a graph is a partition of the vertices into sets such that for every two adjacent vertices and there is an index $…