Babak Samadi

activity

20242026

most citedInduced matching vs edge open packing: trees and product graphs

1 citations · 1 across the 5 of their papers we have counts for

collaborators

Showing 2024 · math.COShow all

2 papers · 2 filters

math.CO2024★ 1 cited

Induced matching vs edge open packing: trees and product graphs

Bostjan Bresar, Tanja Dravec, Jaka Hedzet +1

Given a graph $G$ , the maximum size of an induced subgraph of $G$ each component of which is a star is called the edge open packing number, $ρ_{e}^{o} (G)$ , of $G$ . Similarly, the m…

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…