Browsing Combinatorics and Optimization by Subject "brick generation"
Now showing items 1-1 of 1
-
Brick Generation and Conformal Subgraphs
(University of Waterloo, 2016-04-15)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 ...