Category:Matching (graph theory)

From Wikimedia Commons, the free media repository
Jump to navigation Jump to search
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.


This category has only the following subcategory.


Media in category "Matching (graph theory)"

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