Peyman Afshani

activity

20062009

most citedCircular chromatic index of graphs of maximum degree 3

17 citations · 18 across the 3 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2009★ 1 cited

On the spectrum of the forced matching number of graphs

Peyman Afshani, Hamed Hatami, Ebadollah S. Mahmoodian

Let $G$ be a graph that admits a perfect matching. A {\sf forcing set} for a perfect matching $M$ of $G$ is a subset $S$ of $M$ , such that $S$ is contained in no other perfect matc…

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 $G$ is a graph (parallel edges allowed) of maximum degree 3, then $χ_{c}^{'} (G) \leq 11/3$ provided that $G$ does not contain $H_{1}$ or $H_{2}$ as a subgraph, whe…