The following pages link to Arash Ahadi (Q300223):
Displaying 7 items.
- Touring a sequence of disjoint polygons: complexity and extension (Q300225) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- On the difference between chromatic number and dynamic chromatic number of graphs (Q442373) (← links)
- On the complexity of deciding whether the regular number is at most two (Q497328) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number (Q713309) (← links)
- Is there any polynomial upper bound for the universal labeling of graphs? (Q1680487) (← links)
