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.
This category has only the following subcategory.
- ► Triple-Graph-Grammar (7 F)
Media in category "Matching (graph theory)"
The following 26 files are in this category, out of 26 total.
- Blossom Counter.svg
- Edmonds blossom (vi).svg
- Edmonds lifting path (...
- K4 matchings.svg