graph_matching_covered (381B)
1 # Matching-covered graph 2 3 A *matching-covered graph* is a [graph] where every [edge] is contained in a [perfect_matching] 4 5 Discussed in [he2017perfect] 6 7 Can be [graph_decomposed] with [bricks] and [braces] by the [tight_cut_decomposition], cf [lovasz1987matching] cited in [he2017perfect] 8 9 Up: [graph] 10 11 See also: [matching] 12 13 Aliases: matching covered graph, matching-covered graph