Babak Samadi

13 citations · 13 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

3 papers · 1 filter

math.CO2026

Frugal coloring of graphs revisited

Boštjan Brešar, Wenjie Hu, Babak Samadi

Given a graph $G$ and a positive integer $t$ , an independent set $S \subseteq V (G)$ is $t$ -frugal if every vertex has at most $t$ neighbors in $S$ . A $t$ -frugal coloring of $G$ is a…

math.CO2025

On $k$ -coalition in graphs: bounds and exact values

Boštjan Brešar, Michael A. Henning, Babak Samadi

Given a graph $G=\big{(}V(G),E(G)\big{)}$, a set $S \subseteq V (G)$ is called a $k$ -dominating set if every vertex in $V (G) ∖ S$ has at least $k$ neighbors in $S$ . Two disjoi…

math.CO2024

Edge open packing: complexity, algorithmic aspects, and bounds

Boštjan Brešar, Babak Samadi

Given a graph $G$ , two edges $e_{1}, e_{2} \in E (G)$ are said to have a common edge $e$ if $e$ joins an endvertex of $e_{1}$ to an endvertex of $e_{2}$ . A subset $B \subseteq E (G)$ is…

Frugal coloring of graphs revisited

On k-coalition in graphs: bounds and exact values

Edge open packing: complexity, algorithmic aspects, and bounds

On $k$ -coalition in graphs: bounds and exact values