Matching

A matching is a subset of graph edges in which no vertex occurs more than once.

A matching for a Chimera unit cell: no vertex is incident to more than one edge in the set of blue edges

matching_bqm(G)	Find a binary quadratic model for the graph's matchings.
maximal_matching_bqm(G[, lagrange])	Find a binary quadratic model for the graph's maximal matchings.
min_maximal_matching_bqm(G[, ...])	Find a binary quadratic model for the graph's minimum maximal matchings.
min_maximal_matching(G[, sampler])	Returns an approximate minimum maximal matching.