Category:Matching (graph theory)
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. Optimization problems for a graph involve the dual pair: maximization problem (maximum matching) and a minimization problem (minimum covering)
Category:Uses of Wikidata InfoboxCategory:Uses of Wikidata Infobox with no image
set of edges without common vertices | |||||
| Upload media | |||||
| Subclass of |
| ||||
|---|---|---|---|---|---|
| Part of |
| ||||
| Different from | |||||
| |||||
 | |||||
Pages in category "Category:Matching (graph theory)"
- Category:Triple-Graph-Grammar
- File:3-dimensional-matching.svg
- File:Augmenting path.png
- File:Beispiel Ungarische Methode.svg
- File:Bip2maxflow.jpg
- File:Blossom contraction.png
- File:Blossom Counter.svg
- File:Blossom end point path lifting.png
- File:Blossoms can't be ignored.svg
- File:Chord diagrams K6 matchings.svg
- File:Creating a matching.png
- File:Cross blossom path lifting.png
- File:Different stable matchings.png
- File:Dilworth-via-König.svg
- File:Edmonds augmenting path (vi).svg
- File:Edmonds augmenting path.svg
- File:Edmonds blossom (vi).svg
- File:Edmonds blossom.svg
- File:Edmonds lifting end point.svg
- File:Edmonds lifting path (vi).svg
- File:Edmonds lifting path.svg
- File:Edmonds-example-1.svg
- File:Edmonds-example-2.svg
- File:Edmonds-example-3.svg
- File:Edmonds-example-t7.svg
- File:Forest expansion.png
- File:Halls theorem matching graph theory.svg
- File:Halls theorem matching graph theory2.svg
- File:Halls theorem negartive example.svg
- File:Halls theorem negartive example2.svg
- File:Halls theorem positive example.svg
- File:Halls theorem positive example2.svg
- File:HeiratssatzGraphentheorie.PNG
- File:HeiratssatzNegativBeispiel.PNG
- File:HeiratssatzPositivBeispiel.PNG
- File:Hypergraph matchings.svg
- File:K4 matchings.svg
- File:Koenigs-theorem-graph.png
- File:Koenigs-theorem-graph.svg
- File:Koenigs-theorem-proof.svg
- File:Koenigs-theorem-proof2.svg
- File:Matching (graph theory).jpg
- File:Matching (graph theory).png
- File:Matching Beispiel Qualifikationen.png
- File:Matching.png
- File:Max weight matching.svg
- File:Maximal matching.jpg
- File:Maximal-matching.svg
- File:Maximal-simple.svg
- File:Maximales Matching.png
- File:Maximum cardinality matching.svg
- File:Maximum matching.jpg
- File:Maximum-matching-labels.svg
- File:Maximum-matching.svg
- File:Methode Habr.JPG
- File:Minimum cut in a bipartite graph.svg
- File:Minimum-edge-cover-from-maximum-matching.svg
- File:Path detection.png
- File:Path lifting.png
- File:Perfect matching 1.jpg
- File:Perfect matching 2.jpg
- File:Perfect matching qtl1.svg
- File:Perfect-simple.svg
- File:Perfektes Matching.png
- File:Stakan.svg
- File:Sumner claw-free matching.svg
- File:Sylvester counter.svg
- File:Ungmeth1.JPG
- File:Vertex-cover-from-maximal-matching.svg
.svg){kind=link}
.svg){kind=link}
.svg){kind=link}
.jpg){kind=link}
.png){kind=link}
