| 2008 |
|---|
| 13 | | Amir Daneshgar,
Hossein Hajiabolhassan,
Navid Hamedazimi:
On Connected Colourings of Graphs.
Ars Comb. 89: (2008) |
| 12 | EE | Amir Daneshgar,
Hossein Hajiabolhassan:
Density and power graphs in graph homomorphism problem.
Discrete Mathematics 308(17): 4027-4030 (2008) |
| 2007 |
|---|
| 11 | EE | Abbas Cheraghi,
Hossein Hajiabolhassan:
Lower Bound for Visual Cryptography Schemes
CoRR abs/0710.4828: (2007) |
| 10 | EE | Amir Daneshgar,
Hossein Hajiabolhassan,
Nasrin Soltankhah:
On defining numbers of circular complete graphs.
Discrete Mathematics 307(2): 173-180 (2007) |
| 9 | EE | Amir Daneshgar,
Hossein Hajiabolhassan:
Circular colouring and algebraic no-homomorphism theorems.
Eur. J. Comb. 28(6): 1843-1853 (2007) |
| 2005 |
|---|
| 8 | EE | Amir Daneshgar,
Hossein Hajiabolhassan:
Unique list-colourability and the fixing chromatic number of graphs.
Discrete Applied Mathematics 152(1-3): 123-138 (2005) |
| 7 | EE | Hossein Hajiabolhassan,
Mojtaba L. Mehrabadi,
Ruzbeh Tusserkani:
Tabular graphs and chromatic sum.
Discrete Mathematics 304(1-3): 11-22 (2005) |
| 2004 |
|---|
| 6 | EE | Hossein Hajiabolhassan,
Xuding Zhu:
Sparse H-Colourable Graphs of Bounded Maximum Degree.
Graphs and Combinatorics 20(1): 65-71 (2004) |
| 2003 |
|---|
| 5 | EE | Hossein Hajiabolhassan,
Xuding Zhu:
Circular chromatic number of Kneser graphs.
J. Comb. Theory, Ser. B 88(2): 299-303 (2003) |
| 2002 |
|---|
| 4 | | Yashar Ganjali,
Mohammad Ghebleh,
Hossein Hajiabolhassan,
M. Mirzazadeh,
Sayyed Bashir Sadjad:
Uniquely 2-list colorable graphs.
Discrete Applied Mathematics 119(3): 217-225 (2002) |
| 2000 |
|---|
| 3 | | Hossein Hajiabolhassan,
Mojtaba L. Mehrabadi,
Ruzbeh Tusserkani:
A Note on the Hall-Condition Number of a Graph.
Ars Comb. 55: (2000) |
| 2 | EE | Hossein Hajiabolhassan,
Mojtaba L. Mehrabadi,
Ruzbeh Tusserkani:
Minimal coloring and strength of graphs.
Discrete Mathematics 215: 265-270 (2000) |
| 1999 |
|---|
| 1 | EE | Hossein Hajiabolhassan,
Mojtaba L. Mehrabadi,
Ruzbeh Tusserkani,
Manouchehr Zaker:
A characterization of uniquely vertex colorable graphs using minimal defining sets.
Discrete Mathematics 199(1-3): 233-236 (1999) |
