Reza Naserasr

	2012
18		Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens: Vertex-colouring edge-weightings with two edge weights. Discrete Mathematics & Theoretical Computer Science 14(1): 1-20 (2012)
	2011
17		Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov: Identifying codes in line graphs CoRR abs/1107.0207: (2011)
16		Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens: Digraphs are 2-Weight Choosable. Electr. J. Comb. 18(1): (2011)
15		Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov: Edge identifying codes. Electronic Notes in Discrete Mathematics 38: 343-348 (2011)
14		Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov: Extremal graphs for the identifying code problem. Eur. J. Comb. 32(4): 628-638 (2011)
	2010
13		Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov: Extremal graphs for the identifying code problem CoRR abs/1004.5230: (2010)
12		Florent Foucaud, Reza Naserasr, Aline Parreau: Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets CoRR abs/1010.2985: (2010)
	2009
11		Reza Naserasr, Yared Nigussie, Riste Skrekovski: Homomorphisms of triangle-free graphs without a K5-minor. Discrete Mathematics 309(18): 5789-5798 (2009)
	2007
10		Reza Naserasr: Homomorphisms and edge-colourings of planar graphs. J. Comb. Theory, Ser. B 97(3): 394-400 (2007)
9		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		Reza Naserasr, Yared Nigussie: On a new reformulation of Hadwiger's conjecture. Discrete Mathematics 306(23): 3136-3139 (2006)
7		Reza Naserasr: K5-Free bound for the class of planar graphs. Eur. J. Comb. 27(7): 1155-1158 (2006)
6		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		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		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		Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker: Defining sets in vertex colorings of graphs and latin rectangles. Discrete Mathematics 167-168: 451-460 (1997)

Coauthor Index

1	Amir Daneshgar	[3] [5]
2	Matt DeVos	[9]
3	Javad Ebrahimi	[9]
4	Florent Foucaud	[12] [13] [14] [15] [17]
5	Mohammad Ghebleh	[9]
6	Luis A. Goddyn	[9]
7	Sylvain Gravier	[15] [17]
8	Eleonora Guerrini	[13] [14]
9	Mahdad Khatirinejad	[16] [18]
10	Gholamreza B. Khosrovshahi	[2]
11	Matjaz Kovse	[13] [14]
12	Ebadollah S. Mahmoodian	[1]
13	Bojan Mohar	[9]
14	Mike Newman	[16] [18]
15	Yared Nigussie	[8] [11]
16	Aline Parreau	[12] [13] [14] [15] [17]
17	Ben Seamone	[16] [18]
18	Riste Skrekovski	[4] [11]
19	Brett Stevens	[16] [18]
20	Claude Tardif	[6]
21	Petru Valicov	[13] [14] [15] [17]
22	Manouchehr Zaker	[1]

Colors in the list of coauthors

Last update Sun Jun 3 16:06:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page