default search action
Hossein Hajiabolhassan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j41]Hossein Hajiabolhassan
, Zahra Taheri
FunQG: Molecular Representation Learning via Quotient Graphs. J. Chem. Inf. Model. 63(11): 3275-3287 (2023) - [j40]Thomas Michel, Hossein Hajiabolhassan, Ronald Ortner:
Regret Bounds for Satisficing in Multi-Armed Bandit Problems. Trans. Mach. Learn. Res. 2023 (2023) - 2022
- [i3]Hossein Hajiabolhassan, Zahra Taheri
FunQG: Molecular Representation Learning Via Quotient Graphs. CoRR abs/2207.08597 (2022) - 2020
- [j39]Meysam Alishahi, Hossein Hajiabolhassan
On the Chromatic Number of Matching Kneser Graphs. Comb. Probab. Comput. 29(1): 1-21 (2020)
2010 – 2019
- 2019
- [j38]Meysam Alishahi
On chromatic number and minimum cut. J. Comb. Theory B 139: 27-46 (2019) - 2018
- [j37]Meysam Alishahi
Altermatic number of categorical product of graphs. Discret. Math. 341(5): 1316-1324 (2018) - [j36]Meysam Alishahi
Chromatic number of random Kneser hypergraphs. J. Comb. Theory A 154: 1-20 (2018) - [j35]Meysam Alishahi
A generalization of Gale's lemma. J. Graph Theory 88(2): 337-346 (2018) - 2017
- [j34]Meysam Alishahi
Chromatic number via Turán number. Discret. Math. 340(10): 2366-2377 (2017) - [j33]Meysam Alishahi
Strengthening topological colorful results for graphs. Eur. J. Comb. 64: 27-44 (2017) - 2016
- [j32]Hossein Hajiabolhassan
Hedetniemi's conjecture for Kneser hypergraphs. J. Comb. Theory A 143: 42-55 (2016) - 2015
- [j31]Meysam Alishahi
On the chromatic number of general Kneser hypergraphs. J. Comb. Theory B 115: 186-209 (2015) - 2014
- [j30]Hossein Hajiabolhassan
On the Circular Chromatic Number of Graph Powers. J. Graph Theory 75(1): 48-58 (2014) - 2012
- [j29]Hossein Hajiabolhassan
Some new bounds for cover-free families through biclique covers. Discret. Math. 312(24): 3626-3635 (2012) - [j28]Hossein Hajiabolhassan
Secure Frameproof Code Through Biclique Cover. Discret. Math. Theor. Comput. Sci. 14(2): 261-270 (2012) - 2011
- [j27]Hossein Hajiabolhassan
A generalization of Kneser's conjecture. Discret. Math. 311(23-24): 2663-2668 (2011) - 2010
- [j26]Amir Daneshgar, Hossein Hajiabolhassan, Siamak Taati:
On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs. Ars Comb. 97 (2010) - [j25]Hossein Hajiabolhassan
Graph Powers and Graph Homomorphisms. Electron. J. Comb. 17(1) (2010) - [j24]Hossein Hajiabolhassan
On the b-chromatic number of Kneser graphs. Discret. Appl. Math. 158(3): 232-234 (2010) - [j23]Hossein Hajiabolhassan
Bounds for visual cryptography schemes. Discret. Appl. Math. 158(6): 659-665 (2010) - [j22]Meysam Alishahi
A generalization of the Erdös-Ko-Rado theorem. Discret. Math. 310(1): 188-191 (2010) - [j21]Meysam Alishahi
Circular coloring and Mycielski construction. Discret. Math. 310(10-11): 1544-1550 (2010) - [j20]Amir Daneshgar
On the isoperimetric spectrum of graphs and its approximations. J. Comb. Theory B 100(4): 390-412 (2010) - [i2]Hossein Hajiabolhassan, Farokhlagha Moazami:
Some New Bounds For Cover-Free Families Through Biclique Cover. CoRR abs/1008.3691 (2010)
2000 – 2009
- 2009
- [j19]Hossein Hajiabolhassan
On colorings of graph powers. Discret. Math. 309(13): 4299-4305 (2009) - 2008
- [j18]Amir Daneshgar, Hossein Hajiabolhassan, Navid Hamedazimi:
On Connected Colourings of Graphs. Ars Comb. 89 (2008) - [j17]Amir Daneshgar
Density and power graphs in graph homomorphism problem. Discret. Math. 308(17): 4027-4030 (2008) - 2007
- [j16]Amir Daneshgar
On defining numbers of circular complete graphs. Discret. Math. 307(2): 173-180 (2007) - [j15]Amir Daneshgar
Circular colouring and algebraic no-homomorphism theorems. Eur. J. Comb. 28(6): 1843-1853 (2007) - [i1]Abbas Cheraghi, Hossein Hajiabolhassan:
Lower Bound for Visual Cryptography Schemes. CoRR abs/0710.4828 (2007) - 2005
- [j14]Amir Daneshgar
Unique list-colourability and the fixing chromatic number of graphs. Discret. Appl. Math. 152(1-3): 123-138 (2005) - [j13]Hossein Hajiabolhassan
Tabular graphs and chromatic sum. Discret. Math. 304(1-3): 11-22 (2005) - 2004
- [j12]Hossein Hajiabolhassan
Sparse H-Colourable Graphs of Bounded Maximum Degree. Graphs Comb. 20(1): 65-71 (2004) - 2003
- [j11]Hossein Hajiabolhassan
Circular chromatic number of Kneser graphs. J. Comb. Theory B 88(2): 299-303 (2003) - [j10]Amir Daneshgar
Graph homomorphisms through random walks. J. Graph Theory 44(1): 15-38 (2003) - [j9]Hossein Hajiabolhassan
Circular chromatic number of subgraphs. J. Graph Theory 44(2): 95-105 (2003) - [j8]Hossein Hajiabolhassan
Circular chromatic number and Mycielski construction. J. Graph Theory 44(2): 106-115 (2003) - 2002
- [j7]Yashar Ganjali, Mohammad Ghebleh
Uniquely 2-list colorable graphs. Discret. Appl. Math. 119(3): 217-225 (2002) - 2001
- [c1]Amir Daneshgar, Hossein Hajiabolhassan:
Random Walks and Graph Homomorphisms. Graphs, Morphisms and Statistical Physics 2001: 49-63 - 2000
- [j6]Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani:
A Note on the Hall-Condition Number of a Graph. Ars Comb. 55 (2000) - [j5]Hossein Hajiabolhassan
Minimal coloring and strength of graphs. Discret. Math. 215: 265-270 (2000)
1990 – 1999
- 1999
- [j4]Hossein Hajiabolhassan
A characterization of uniquely vertex colorable graphs using minimal defining sets. Discret. Math. 199(1-3): 233-236 (1999) - 1998
- [j3]Changiz Eslahchi, Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani:
A counterexample for Hilton-Johnson's conjecture on list coloring of graphs. Australas. J Comb. 18: 127-132 (1998) - [j2]Hossein Hajiabolhassan, Mojtaba L. Mehrabadi:
On clique polynomials. Australas. J Comb. 18: 313- (1998) - 1997
- [j1]Saieed Akbari
Uniquely Total Colorable Graphs. Graphs Comb. 13(4): 305-314 (1997)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: