Hossein Hajiabolhassan

Zahra Taheri

Ali Hojatnia

Yavar Taheri Yeganeh

J. Chem. Inf. Model., June, 2023

Regret Bounds for Satisficing in Multi-Armed Bandit Problems.

[BibT_eX]

[DOI]

Thomas Michel

Ronald Ortner

Trans. Mach. Learn. Res., 2023

2020

On the Chromatic Number of Matching Kneser Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2020

2019

On chromatic number and minimum cut.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2019

2018

A generalization of Gale's lemma.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Chromatic number of random Kneser hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2018

Altermatic number of categorical product of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2018

2017

Strengthening topological colorful results for graphs.

[BibT_eX]

[DOI]

Frédéric Meunier

Eur. J. Comb., 2017

Chromatic number via Turán number.

[BibT_eX]

[DOI]

Discret. Math., 2017

2016

Hedetniemi's conjecture for Kneser hypergraphs.

[BibT_eX]

[DOI]

Frédéric Meunier

J. Comb. Theory A, 2016

2015

On the chromatic number of general Kneser hypergraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2015

2014

On the Circular Chromatic Number of Graph Powers.

[BibT_eX]

[DOI]

Ali Taherkhani

J. Graph Theory, 2014

2012

Secure Frameproof Code Through Biclique Cover.

[BibT_eX]

[DOI]

Farokhlagha Moazami

Discret. Math. Theor. Comput. Sci., 2012

Some new bounds for cover-free families through biclique covers.

[BibT_eX]

[DOI]

Farokhlagha Moazami

Discret. Math., 2012

2011

A generalization of Kneser's conjecture.

[BibT_eX]

[DOI]

Discret. Math., 2011

2010

On the isoperimetric spectrum of graphs and its approximations.

[BibT_eX]

[DOI]

Ramin Javadi

J. Comb. Theory B, 2010

A generalization of the Erdös-Ko-Rado theorem.

[BibT_eX]

[DOI]

Ali Taherkhani

Discret. Math., 2010

Circular coloring and Mycielski construction.

[BibT_eX]

[DOI]

Discret. Math., 2010

Bounds for visual cryptography schemes.

[BibT_eX]

[DOI]

Abbas Cheraghi

Discret. Appl. Math., 2010

On the b-chromatic number of Kneser graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Some New Bounds For Cover-Free Families Through Biclique Cover.

[BibT_eX]

[DOI]

Farokhlagha Moazami

CoRR, 2010

Graph Powers and Graph Homomorphisms.

[BibT_eX]

[DOI]

Ali Taherkhani

Electron. J. Comb., 2010

On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs.

[BibT_eX]

Siamak Taati

Ars Comb., 2010

2009

On colorings of graph powers.

[BibT_eX]

[DOI]

Discret. Math., 2009

2008

Density and power graphs in graph homomorphism problem.

[BibT_eX]

[DOI]

Discret. Math., 2008

On Connected Colourings of Graphs.

[BibT_eX]

Navid Hamedazimi

Ars Comb., 2008

2007

Circular colouring and algebraic no-homomorphism theorems.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

On defining numbers of circular complete graphs.

[BibT_eX]

[DOI]

Nasrin Soltankhah

Discret. Math., 2007

Lower Bound for Visual Cryptography Schemes

[BibT_eX]

[DOI]

Abbas Cheraghi

CoRR, 2007

2005

Tabular graphs and chromatic sum.

[BibT_eX]

[DOI]

Discret. Math., 2005

Unique list-colourability and the fixing chromatic number of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

2004

Sparse <i>H</i>-Colourable Graphs of Bounded Maximum Degree.

[BibT_eX]

[DOI]

Graphs Comb., 2004

2003

Circular chromatic number and Mycielski construction.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Circular chromatic number of subgraphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Graph homomorphisms through random walks.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

Circular chromatic number of Kneser graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

2002

Uniquely 2-list colorable graphs.

[BibT_eX]

[DOI]

Yashar Ganjali

Mohammad Ghebleh

M. Mirzazadeh

Sayyed Bashir Sadjad

Discret. Appl. Math., 2002

2001

Random Walks and Graph Homomorphisms.

[BibT_eX]

[DOI]

Proceedings of the Graphs, 2001

2000

Minimal coloring and strength of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

A Note on the Hall-Condition Number of a Graph.

[BibT_eX]

Ars Comb., 2000

1999

A characterization of uniquely vertex colorable graphs using minimal defining sets.

[BibT_eX]

[DOI]

Manouchehr Zaker

Discret. Math., 1999

1998

On clique polynomials.

[BibT_eX]

[DOI]

Australas. J Comb., 1998

A counterexample for Hilton-Johnson's conjecture on list coloring of graphs.

[BibT_eX]

[DOI]

Changiz Eslahchi

Australas. J Comb., 1998

1997

Uniquely Total Colorable Graphs.

[BibT_eX]

[DOI]

Saieed Akbari

Mehdi Behzad