论文部分内容阅读
A patch is a plane graph whose boundary is an elementary circuit with only vertices of degree 2 or 3,with all degree-2 vertices restricted to the boundary.A Kekul(e)structure for a patch is a perfect matching.Not all patches admit a perfect matching; we define internal Kekul(e)structures,which match all degree-3 vertices but not necessarily all degree-2 vertices.