Reza Naserasr

According to our database1, Reza Naserasr authored at least 50 papers between 1997 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of two.



In proceedings 
PhD thesis 




Homomorphisms of signed graphs: An update.
Eur. J. Comb., 2021

Homomorphisms of partial <i>t</i>-trees and edge-colorings of partial 3-trees.
J. Comb. Theory, Ser. B, 2020

Sensitivity lower bounds from linear dependencies.
Electron. Colloquium Comput. Complex., 2020

Extension of Gyarfas-Sumner conjecture to digraphs.
CoRR, 2020

Exact square coloring of subcubic planar graphs.
CoRR, 2020

Homomorphisms of Sparse Signed Graphs.
Electron. J. Comb., 2020

Smallest C<sub>2l+1</sub>-Critical Graphs of Odd-Girth 2k+1.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

When an optimal dominating set with given constraints exists.
Theor. Comput. Sci., 2019

Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs.
Discret. Appl. Math., 2019

Safe sets in graphs: Graph classes and structural parameters.
J. Comb. Optim., 2018

The optimal routing of augmented cubes.
Inf. Process. Lett., 2018

Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds.
Theor. Comput. Sci., 2017

Homomorphism bounds and edge-colourings of K<sub>4</sub>-minor-free graphs.
J. Comb. Theory, Ser. B, 2017

The complexity of signed graph and edge-coloured graph homomorphisms.
Discret. Math., 2017

The complexity of tropical graph homomorphisms.
Discret. Appl. Math., 2017

Towards A Unified View of Linear Structure on Graph Classes.
CoRR, 2017

Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity.
Algorithmica, 2017

A New Graph Parameter to Measure Linearity.
Proceedings of the Combinatorial Optimization and Applications, 2017

Walk-Powers and Homomorphism Bounds of Planar Signed Graphs.
Graphs Comb., 2016

Mapping planar graphs into the Coxeter graph.
Discret. Math., 2016

Bipartite edge partitions and the former Alon-Saks-Seymour conjecture.
Australas. J Comb., 2016

Safe Sets in Graphs: Graph Classes and Structural Parameters.
Proceedings of the Combinatorial Optimization and Applications, 2016

Homomorphisms of Signed Graphs.
J. Graph Theory, 2015

Homomorphisms of binary Cayley graphs.
Discret. Math., 2015

Walk-powers and homomorphism bound of planar graphs.
CoRR, 2015

The complexity of signed graph and 2-edge-coloured graph homomorphisms.
CoRR, 2015

From Edge-Coloring to Strong Edge-Coloring.
Electron. J. Comb., 2015

Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2015

Identification, location-domination and metric dimension on interval and permutation graphs.
CoRR, 2014

The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Mapping Planar Graphs into Projective Cubes.
J. Graph Theory, 2013

Identifying Codes in Line Graphs.
J. Graph Theory, 2013

Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets.
Graphs Comb., 2013

Homomorphisms of planar signed graphs to signed projective cubes.
Discret. Math. Theor. Comput. Sci., 2013

Vertex-colouring edge-weightings with two edge weights.
Discret. Math. Theor. Comput. Sci., 2012

Edge identifying codes.
Electron. Notes Discret. Math., 2011

Extremal graphs for the identifying code problem.
Eur. J. Comb., 2011

Digraphs are 2-Weight Choosable.
Electron. J. Comb., 2011

Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets
CoRR, 2010

Homomorphisms of triangle-free graphs without a K<sub>5</sub>-minor.
Discret. Math., 2009

Circular Coloring the Plane.
SIAM J. Discret. Math., 2007

Homomorphisms and edge-colourings of planar graphs.
J. Comb. Theory, Ser. B, 2007

The chromatic covering number of a graph.
J. Graph Theory, 2006

<i>K</i><sub>5</sub>-Free bound for the class of planar graphs.
Eur. J. Comb., 2006

On a new reformulation of Hadwiger's conjecture.
Discret. Math., 2006

The Petersen graph is not 3-edge-colorable--a new proof.
Discret. Math., 2003

On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets.
Ars Comb., 2003

On small uniquely vertex-colourable graphs and Xu's conjecture.
Discret. Math., 2000

Hypergraphical Codes Arising from Binary Trades.
Des. Codes Cryptogr., 1999

Defining sets in vertex colorings of graphs and latin rectangles.
Discret. Math., 1997