Perfect Matchings
摘要
Perfect matchings in graphs have been of interest ever since Tait showed that the four colour conjecture was equivalent to the statement that every 3-connected cubic planar graph is 3-edge-colourable or, equivalently, that such a graph has three pairwise edge-disjoint perfect matchings (see Bondy and Murty [3]).