17 citations · 18 across the 3 of their papers we have counts for
3 papers
math.CO2009★ 1 cited
On the spectrum of the forced matching number of graphs
Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian
Let be a graph that admits a perfect matching. A {\sf forcing set} for a perfect matching of is a subset of , such that is contained in no other perfect matc…
cs.CG2007
Approximation and Inapproximability Results for Maximum Clique of Disc Graphs in High Dimensions
Peyman Afshani, Hamed Hatami
We prove algorithmic and hardness results for the problem of finding the largest set of a fixed diameter in the Euclidean space. In particular, we prove that if is the larges…
math.CO2006★ 17 cited
Circular chromatic index of graphs of maximum degree 3
Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari +3
This paper proves that if is a graph (parallel edges allowed) of maximum degree 3, then provided that does not contain or as a subgraph, whe…