Uniquely Total Colorable Graphs. - Saieed Akbari; Mehdi Behzad; Hossein Hajiabolhassan; Ebadollah S. Mahmoodian (Graphs Comb., 1997)

A counterexample for Hilton-Johnson's conjecture on list coloring of graphs. - Changiz Eslahchi; Hossein Hajiabolhassan; Mojtaba L. Mehrabadi; Ruzbeh Tusserkani (Australas. J Comb., 1998)

On clique polynomials. - Hossein Hajiabolhassan; Mojtaba L. Mehrabadi (Australas. J Comb., 1998)

A characterization of uniquely vertex colorable graphs using minimal defining sets. - Hossein Hajiabolhassan; Mojtaba L. Mehrabadi; Ruzbeh Tusserkani; Manouchehr Zaker (Discret. Math., 1999)

A Note on the Hall-Condition Number of a Graph. - Hossein Hajiabolhassan; Mojtaba L. Mehrabadi; Ruzbeh Tusserkani (Ars Comb., 2000)

Minimal coloring and strength of graphs. - Hossein Hajiabolhassan; Mojtaba L. Mehrabadi; Ruzbeh Tusserkani (Discret. Math., 2000)

Random Walks and Graph Homomorphisms. - Amir Daneshgar; Hossein Hajiabolhassan (Graphs, Morphisms and Statistical Physics, 2001)

Uniquely 2-list colorable graphs. - Yashar Ganjali; Mohammad Ghebleh; Hossein Hajiabolhassan; M. Mirzazadeh; Sayyed Bashir Sadjad (Discret. Appl. Math., 2002)

Circular chromatic number of Kneser graphs. - Hossein Hajiabolhassan; Xuding Zhu (J. Comb. Theory B, 2003)

Graph homomorphisms through random walks. - Amir Daneshgar; Hossein Hajiabolhassan (J. Graph Theory, 2003)

Circular chromatic number of subgraphs. - Hossein Hajiabolhassan; Xuding Zhu (J. Graph Theory, 2003)

Circular chromatic number and Mycielski construction. - Hossein Hajiabolhassan; Xuding Zhu (J. Graph Theory, 2003)

Sparse H-Colourable Graphs of Bounded Maximum Degree. - Hossein Hajiabolhassan; Xuding Zhu (Graphs Comb., 2004)

Unique list-colourability and the fixing chromatic number of graphs. - Amir Daneshgar; Hossein Hajiabolhassan (Discret. Appl. Math., 2005)

Tabular graphs and chromatic sum. - Hossein Hajiabolhassan; Mojtaba L. Mehrabadi; Ruzbeh Tusserkani (Discret. Math., 2005)

Lower Bound for Visual Cryptography Schemes - Abbas Cheraghi; Hossein Hajiabolhassan (CoRR, 2007)

On defining numbers of circular complete graphs. - Amir Daneshgar; Hossein Hajiabolhassan; Nasrin Soltankhah (Discret. Math., 2007)

Circular colouring and algebraic no-homomorphism theorems. - Amir Daneshgar; Hossein Hajiabolhassan (Eur. J. Comb., 2007)

On Connected Colourings of Graphs. - Amir Daneshgar; Hossein Hajiabolhassan; Navid Hamedazimi (Ars Comb., 2008)

Density and power graphs in graph homomorphism problem. - Amir Daneshgar; Hossein Hajiabolhassan (Discret. Math., 2008)

On colorings of graph powers. - Hossein Hajiabolhassan (Discret. Math., 2009)

On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs. - Amir Daneshgar; Hossein Hajiabolhassan; Siamak Taati (Ars Comb., 2010)

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

Some New Bounds For Cover-Free Families Through Biclique Cover. - Hossein Hajiabolhassan; Farokhlagha Moazami (CoRR, 2010)

On the b-chromatic number of Kneser graphs. - Hossein Hajiabolhassan (Discret. Appl. Math., 2010)

Bounds for visual cryptography schemes. - Hossein Hajiabolhassan; Abbas Cheraghi (Discret. Appl. Math., 2010)

Circular coloring and Mycielski construction. - Meysam Alishahi; Hossein Hajiabolhassan (Discret. Math., 2010)

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

On the isoperimetric spectrum of graphs and its approximations. - Amir Daneshgar; Hossein Hajiabolhassan; Ramin Javadi (J. Comb. Theory B, 2010)

A generalization of Kneser's conjecture. - Hossein Hajiabolhassan (Discret. Math., 2011)

Some new bounds for cover-free families through biclique covers. - Hossein Hajiabolhassan; Farokhlagha Moazami (Discret. Math., 2012)

Secure Frameproof Code Through Biclique Cover. - Hossein Hajiabolhassan; Farokhlagha Moazami (Discret. Math. Theor. Comput. Sci., 2012)

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

On the chromatic number of general Kneser hypergraphs. - Meysam Alishahi; Hossein Hajiabolhassan (J. Comb. Theory B, 2015)

Hedetniemi's conjecture for Kneser hypergraphs. - Hossein Hajiabolhassan; Frédéric Meunier (J. Comb. Theory A, 2016)

Chromatic number via Turán number. - Meysam Alishahi; Hossein Hajiabolhassan (Discret. Math., 2017)

Strengthening topological colorful results for graphs. - Meysam Alishahi; Hossein Hajiabolhassan; Frédéric Meunier (Eur. J. Comb., 2017)

Altermatic number of categorical product of graphs. - Meysam Alishahi; Hossein Hajiabolhassan (Discret. Math., 2018)

Chromatic number of random Kneser hypergraphs. - Meysam Alishahi; Hossein Hajiabolhassan (J. Comb. Theory A, 2018)

A generalization of Gale's lemma. - Meysam Alishahi; Hossein Hajiabolhassan (J. Graph Theory, 2018)

On chromatic number and minimum cut. - Meysam Alishahi; Hossein Hajiabolhassan (J. Comb. Theory B, 2019)

On the Chromatic Number of Matching Kneser Graphs. - Meysam Alishahi; Hossein Hajiabolhassan (Comb. Probab. Comput., 2020)

Regret Bounds for Satisficing in Multi-Armed Bandit Problems. - Thomas Michel; Hossein Hajiabolhassan; Ronald Ortner (Trans. Mach. Learn. Res., 2023)

FunQG: Molecular Representation Learning via Quotient Graphs. - Hossein Hajiabolhassan; Zahra Taheri; Ali Hojatnia; Yavar Taheri Yeganeh (J. Chem. Inf. Model., 2023)