A Hall-type theorem with algorithmic consequences in planar graphs

Ebrahim Ghorbani, Hossein Jowhari

Given a graph $G=(V,E)$, for a vertex set $S\subseteq V$, let $N(S)$ denote the set of vertices in $V$ that have a neighbor in $S$. Extending the concept of binding number of graph…