Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 1 of 1 for “"conformal subgraphs"”.

  1. Brick Generation and Conformal Subgraphs

    A nontrivial connected graph is matching covered if each of its edges lies in a perfect matching. Two types of decompositions of matching covered graphs, namely ear decompositions and tight cut decompositions, have played key roles in the theory of these graphs. Any tight cut decomposition of a …

    waterloo Repository record for Brick Generation and Conformal Subgraphs (opens in a new tab)