Matching Covered
# Definition
Let $G$ be an Undirected Graph and let $M \subset E(G)$ be a Matching on $G$. we say that $v \in V(G)$ is covered by $M$ if $$|{e \in M : u \cap e \neq \emptyset}| = 1.$$
Search
Let $G$ be an Undirected Graph and let $M \subset E(G)$ be a Matching on $G$. we say that $v \in V(G)$ is covered by $M$ if $$|{e \in M : u \cap e \neq \emptyset}| = 1.$$