Editing Matching (graph theory) (section)

== See also ==
* [[Matching in hypergraphs]] - a generalization of matching in graphs.
* [[Fractional matching]].
* [[Dulmage–Mendelsohn decomposition]], a partition of the vertices of a bipartite graph into subsets such that each edge belongs to a perfect matching if and only if its endpoints belong to the same subset
* [[Edge coloring]], a partition of the edges of a graph into matchings
* [[Matching preclusion]], the minimum number of edges to delete to prevent a perfect matching from existing
* [[Rainbow matching]], a matching in an edge-colored bipartite graph with no repeated colors
* [[Skew-symmetric graph]], a type of graph that can be used to model alternating path searches for matchings
* [[Stable matching]], a matching in which no two elements prefer each other to their matched partners
* [[Independent vertex set]], a set of vertices (rather than edges) no two of which are adjacent to each other
* [[Stable marriage problem]] (also known as stable matching problem)