The SCEAS System
| |||||||

## Search the dblp DataBase
Hossein Hajiabolhassan:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
**A Note on the Hall-Condition Number of a Graph.**[Citation Graph (0, 0)][DBLP] Ars Comb., 2000, v:55, n:, pp:- [Journal] - Amir Daneshgar, Hossein Hajiabolhassan
**Unique list-colourability and the fixing chromatic number of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:123-138 [Journal] - Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabolhassan, M. Mirzazadeh, Sayyed Bashir Sadjad
**Uniquely 2-list colorable graphs.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:119, n:3, pp:217-225 [Journal] - Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
**Minimal coloring and strength of graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:215, n:, pp:265-270 [Journal] - Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
**Tabular graphs and chromatic sum.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2005, v:304, n:1-3, pp:11-22 [Journal] - Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah
**On defining numbers of circular complete graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:2, pp:173-180 [Journal] - Hossein Hajiabolhassan, Xuding Zhu
**Sparse**[Citation Graph (0, 0)][DBLP]*H*-Colourable Graphs of Bounded Maximum Degree. Graphs and Combinatorics, 2004, v:20, n:1, pp:65-71 [Journal] - Hossein Hajiabolhassan, Xuding Zhu
**Circular chromatic number of Kneser graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 2003, v:88, n:2, pp:299-303 [Journal] - Abbas Cheraghi, Hossein Hajiabolhassan
**Lower Bound for Visual Cryptography Schemes**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] - Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker
**A characterization of uniquely vertex colorable graphs using minimal defining sets.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:199, n:1-3, pp:233-236 [Journal] **On Connected Colourings of Graphs.**[Citation Graph (, )][DBLP]**On the b-chromatic number of Kneser graphs.**[Citation Graph (, )][DBLP]**Bounds for visual cryptography schemes.**[Citation Graph (, )][DBLP]**Density and power graphs in graph homomorphism problem.**[Citation Graph (, )][DBLP]**On colorings of graph powers.**[Citation Graph (, )][DBLP]**Circular coloring and Mycielski construction.**[Citation Graph (, )][DBLP]**A generalization of the Erdös-Ko-Rado theorem.**[Citation Graph (, )][DBLP]**Circular colouring and algebraic no-homomorphism theorems.**[Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.004secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |