Graph Powers and Graph Homomorphisms. - Hossein Hajiabolhassan; Ali Taherkhani (Electron. J. Comb., 2010)

A generalization of the Erdös-Ko-Rado theorem. - Meysam Alishahi; Hossein Hajiabolhassan; Ali Taherkhani (Discret. Math., 2010)

Rainbow Paths with Prescribed Ends. - Meysam Alishahi; Ali Taherkhani; Carsten Thomassen (Electron. J. Comb., 2011)

A Note on Chromatic Sum. - Meysam Alishahi; Ali Taherkhani (Ars Comb., 2014)

On the Circular Chromatic Number of Graph Powers. - Hossein Hajiabolhassan; Ali Taherkhani (J. Graph Theory, 2014)

On r-dynamic chromatic number of graphs. - Ali Taherkhani (Discret. Appl. Math., 2016)

Circular chromatic number of induced subgraphs of Kneser graphs. - Meysam Alishahi; Ali Taherkhani (Ars Math. Contemp., 2018)

Coloring properties of categorical product of general Kneser hypergraphs. - Roya Abyazi Sani; Meysam Alishahi; Ali Taherkhani (Ars Math. Contemp., 2018)

Extremal G-free induced subgraphs of Kneser graphs. - Meysam Alishahi; Ali Taherkhani (J. Comb. Theory A, 2018)

On the random version of the Erdős matching conjecture. - Meysam Alishahi; Ali Taherkhani (Discret. Appl. Math., 2019)

A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra. - Amir Daneshgar; Ali Taherkhani (Discret. Math., 2019)

Size and Structure of Large $(s, t)$-Union Intersecting Families. - Ali Taherkhani (Electron. J. Comb., 2022)

A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs. - Yaser Rowshan; Ali Taherkhani (Discret. Math., 2022)

Partitioning of a graph into induced subgraphs not containing prescribed cliques. - Yaser Rowshan; Ali Taherkhani (Discret. Appl. Math., 2024)