The following pages link to Reza Naserasr (Q184675):
Displaying 50 items.
- Identification, location-domination and metric dimension on interval and permutation graphs. I: Bounds. (Q512651) (← links)
- Digraphs are 2-weight choosable (Q625384) (← links)
- Smallest \(C_{2l+1}\)-critical graphs of odd-girth \(2k+1\) (Q779195) (← links)
- Homomorphisms of sparse signed graphs (Q782945) (← links)
- \(K_{5}\)-free bound for the class of planar graphs (Q852707) (← links)
- On a new reformulation of Hadwiger's conjecture (Q856862) (← links)
- Homomorphisms and edge-colourings of planar graphs (Q875942) (← links)
- Mapping planar graphs into the Coxeter graph (Q898148) (← links)
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor (Q1045075) (← links)
- On compressing complete designs (Q1298922) (← links)
- Defining sets in vertex colorings of graphs and latin rectangles (Q1356483) (← links)
- The Petersen graph is not 3-edge-colorable---a new proof (Q1398278) (← links)
- On small uniquely vertex-colourable graphs and Xu's conjecture (Q1587598) (← links)
- Hypergraphical codes arising from binary trades (Q1591636) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- A new graph parameter to measure linearity (Q1708605) (← links)
- A new approach towards a conjecture on intersecting three longest paths (Q1713782) (← links)
- The optimal routing of augmented cubes (Q1751422) (← links)
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs (Q1989955) (← links)
- The complexity of tropical graph homomorphisms (Q2012054) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- Circular chromatic number of signed graphs (Q2034071) (← links)
- Density of \(C_{-4}\)-critical signed graphs (Q2072181) (← links)
- Complex and homomorphic chromatic number of signed planar simple graphs (Q2117521) (← links)
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) (Q2161276) (← links)
- Homomorphisms of partial \(t\)-trees and edge-colorings of partial 3-trees (Q2200916) (← links)
- Homomorphisms of signed graphs: an update (Q2225427) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- The complexity of signed graph and edge-coloured graph homomorphisms (Q2374178) (← links)
- Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092) (← links)
- Identification, location-domination and metric dimension on interval and permutation graphs. II: Algorithms and complexity (Q2408094) (← links)
- Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs (Q2414452) (← links)
- When an optimal dominating set with given constraints exists (Q2420615) (← links)
- Extremal graphs for the identifying code problem (Q2430979) (← links)
- Homomorphisms of binary Cayley graphs (Q2515600) (← links)
- Walk-powers and homomorphism bounds of planar signed graphs (Q2631091) (← links)
- Exact square coloring of subcubic planar graphs (Q2659166) (← links)
- Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs (Q2827829) (← links)
- Edge identifying codes (Q2857369) (← links)
- Mapping planar graphs into projective cubes (Q2862543) (← links)
- Safe Sets in Graphs: Graph Classes and Structural Parameters (Q2958317) (← links)
- Circular Coloring the Plane (Q3503228) (← links)
- (Q4594195) (← links)
- (Q4995309) (← links)
- (Q4995318) (← links)
- (Q5089234) (← links)
- Homomorphisms of Signed Graphs (Q5265329) (← links)
- Identifying Codes in Line Graphs (Q5325952) (← links)
- (Q5403011) (← links)
- The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction (Q5405070) (← links)
