A Conjecture of Lovász Concerning Bricks
摘要
The properties of matching covered graphs with nontrivial tight cuts may often be deduced from those of their bricks and braces. But to deal with bricks and braces themselves, which are free of such cuts, one requires subtler inductive tools. In case of bricks, for example, optimal ear decompositions, that is, ear decompositions with as few double ear additions as possible, turn out to be useful for analyzing their properties.