Last modified on 10 May 2013, at 19:09

Category:Matching (graph theory)

English: In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices.
System-search.svgSee also category: Vertex cover problem


This category has only the following subcategory.


Media in category "Matching (graph theory)"

The following 36 files are in this category, out of 36 total.