A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Structuring the elementary components of graphs having a perfect internal matching
2003
Theoretical Computer Science
Graphs with perfect internal matchings are decomposed into elementary components, and these components are given a structure re ecting the order in which they can be reached by external alternating paths. It is shown that the set of elementary components can be grouped into pairwise disjoint families determined by the "two-way accessible" relationship among them. A family tree is established by which every family member, except the root, has a unique father and mother identiÿed as another
doi:10.1016/s0304-3975(02)00048-8
fatcat:wxubferk35gozewbyrdsxtsvaq