| 2007 |
|---|
| 10 | EE | Reza Naserasr:
Homomorphisms and edge-colourings of planar graphs.
J. Comb. Theory, Ser. B 97(3): 394-400 (2007) |
| 9 | EE | Matt DeVos,
Javad Ebrahimi,
Mohammad Ghebleh,
Luis A. Goddyn,
Bojan Mohar,
Reza Naserasr:
Circular Coloring the Plane.
SIAM J. Discrete Math. 21(2): 461-465 (2007) |
| 2006 |
|---|
| 8 | EE | Reza Naserasr,
Yared Nigussie:
On a new reformulation of Hadwiger's conjecture.
Discrete Mathematics 306(23): 3136-3139 (2006) |
| 7 | EE | Reza Naserasr:
K5-Free bound for the class of planar graphs.
Eur. J. Comb. 27(7): 1155-1158 (2006) |
| 6 | EE | Reza Naserasr,
Claude Tardif:
The chromatic covering number of a graph.
Journal of Graph Theory 51(3): 199-204 (2006) |
| 2003 |
|---|
| 5 | | Amir Daneshgar,
Reza Naserasr:
On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets.
Ars Comb. 69: (2003) |
| 4 | EE | Reza Naserasr,
Riste Skrekovski:
The Petersen graph is not 3-edge-colorable--a new proof.
Discrete Mathematics 268(1-3): 325-326 (2003) |
| 2000 |
|---|
| 3 | EE | Amir Daneshgar,
Reza Naserasr:
On small uniquely vertex-colourable graphs and Xu's conjecture.
Discrete Mathematics 223(1-3): 93-108 (2000) |
| 1999 |
|---|
| 2 | | Gholamreza B. Khosrovshahi,
Reza Naserasr:
Hypergraphical Codes Arising from Binary Trades.
Des. Codes Cryptography 18(1/3): 183-186 (1999) |
| 1997 |
|---|
| 1 | EE | Ebadollah S. Mahmoodian,
Reza Naserasr,
Manouchehr Zaker:
Defining sets in vertex colorings of graphs and latin rectangles.
Discrete Mathematics 167-168: 451-460 (1997) |
