We identify a family of $O(|E(G)|^2)$ nontrivial facets of the connected matching polytope of a graph $G$, that is, the convex hull of incidence vectors of matchings in $G$ whose covered vertices induce a connected subgraph. Accompanying software to further inspect the polytope of an input graph is available.

翻译：我们识别了图$G$的连通匹配多面体（即$G$中覆盖顶点诱导连通子图的匹配的关联向量的凸包）的一族$O(|E(G)|^2)$个非平凡面。提供了进一步检查输入图多面体的配套软件。