The following pages link to Manouchehr Zaker (Q260060):
Displaying 43 items.
- Lower bounds for the independence and \(k\)-independence number of graphs using the concept of degenerate degrees (Q260061) (← links)
- First-fit colorings of graphs with no cycles of a prescribed even length (Q326475) (← links)
- On dynamic monopolies of graphs with general thresholds (Q409449) (← links)
- On dynamic monopolies of graphs: the average and strict majority thresholds (Q448965) (← links)
- On \((\delta, \chi)\)-bounded families of graphs (Q540113) (← links)
- Bounds for chromatic number in terms of even-girth and booksize (Q616000) (← links)
- Results on the Grundy chromatic number of graphs (Q856867) (← links)
- Maximum transversal in partial Latin squares and rainbow matchings (Q869577) (← links)
- Defining sets in vertex colorings of graphs and latin rectangles (Q1356483) (← links)
- A new vertex coloring heuristic and corresponding chromatic number (Q2196603) (← links)
- Some comparative results concerning the Grundy and \(b\)-chromatic number of graphs (Q2243130) (← links)
- On lower bounds for the chromatic number in terms of vertex degree (Q2275368) (← links)
- A note on orientation and chromatic number of graphs (Q2410109) (← links)
- Generalized degeneracy, dynamic monopolies and maximum degenerate subgraphs (Q2444564) (← links)
- Dynamic monopolies in directed graphs: the spread of unilateral influence in social networks (Q2449109) (← links)
- Inequalities for the Grundy chromatic number of graphs (Q2462396) (← links)
- Bounds for the b-chromatic number of some families of graphs (Q2488938) (← links)
- On Grundy and b-chromatic number of some families of graphs: a comparative study (Q2657109) (← links)
- A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs (Q2689124) (← links)
- (Q2712526) (← links)
- ON DYNAMIC MONOPOLIES OF GRAPHS WITH PROBABILISTIC THRESHOLDS (Q2933686) (← links)
- (Q3070355) (← links)
- $(\delta, \chi_{_{\sf FF}})$-bounded families of graphs (Q3119319) (← links)
- On irreversible spread of influence in edge-weighted graphs (Q3303530) (← links)
- Greedy defining sets in graphs and Latin squares (Q3439453) (← links)
- New bounds for the chromatic number of graphs (Q3506313) (← links)
- (Q4533083) (← links)
- (Q4566364) (← links)
- (Q4576358) (← links)
- (Q4598353) (← links)
- (Q4659607) (← links)
- On monopoly and dynamic monopoly of Cartesian product of graphs with constant thresholds (Q5016057) (← links)
- (Q5037233) (← links)
- More results on greedy defining sets (Q5248305) (← links)
- On the Largest Dynamic Monopolies of Graphs with a Given Average Threshold (Q5252193) (← links)
- Weak dynamic monopolies in social graphs (Q5273081) (← links)
- Bounds for the Grundy chromatic number of graphs in terms of domination number (Q6073792) (← links)
- More results on the \(z\)-chromatic number of graphs (Q6110594) (← links)
- More algorithmic results for problems of spread of influence in edge-weighted graphs with and without incentives (Q6524038) (← links)
- Spread of influence with incentives in edge-weighted graphs with emphasis on some families of graphs (Q6571269) (← links)
- Upper bounds for some graph invariants in terms of blocks and cut-vertices (Q6657261) (← links)
- $\mathcal{O}(VE)$ time algorithms for the Grundy (First-Fit) chromatic number of block graphs and graphs with sufficiently large girth (Q6731045) (← links)
- On z-coloring and ${\rm b}^{\ast}$-coloring of graphs as improved variants of the b-coloring (Q6741463) (← links)
