| |
| 2008 | ||
|---|---|---|
| 8 | Amir Daneshgar, Hossein Hajiabolhassan, Navid Hamedazimi: On Connected Colourings of Graphs. Ars Comb. 89: (2008) | |
| 7 | EE | Amir Daneshgar, Hossein Hajiabolhassan: Density and power graphs in graph homomorphism problem. Discrete Mathematics 308(17): 4027-4030 (2008) |
| 2007 | ||
| 6 | EE | Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah: On defining numbers of circular complete graphs. Discrete Mathematics 307(2): 173-180 (2007) |
| 5 | EE | Amir Daneshgar, Hossein Hajiabolhassan: Circular colouring and algebraic no-homomorphism theorems. Eur. J. Comb. 28(6): 1843-1853 (2007) |
| 2005 | ||
| 4 | EE | Amir Daneshgar, Hossein Hajiabolhassan: Unique list-colourability and the fixing chromatic number of graphs. Discrete Applied Mathematics 152(1-3): 123-138 (2005) |
| 2003 | ||
| 3 | Amir Daneshgar, Reza Naserasr: On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets. Ars Comb. 69: (2003) | |
| 2001 | ||
| 2 | EE | Amir Daneshgar: Forcing Structures and Cliques in Uniquely Vertex Colorable Graphs. SIAM J. Discrete Math. 14(4): 433-445 (2001) |
| 2000 | ||
| 1 | EE | Amir Daneshgar, Reza Naserasr: On small uniquely vertex-colourable graphs and Xu's conjecture. Discrete Mathematics 223(1-3): 93-108 (2000) |
| 1 | Hossein Hajiabolhassan | [4] [5] [6] [7] [8] |
| 2 | Navid Hamedazimi | [8] |
| 3 | Reza Naserasr | [1] [3] |
| 4 | Nasrin Soltankhah | [6] |