Category:Matching (graph theory)

Subcategories

This category has only the following subcategory.

S

Stable matching (13 P)

Pages in category "Matching (graph theory)"

The following 49 pages are in this category, out of 49 total. This list may not reflect recent changes.

Matching (graph theory)

0–9

A

Assignment problem

B

C

D

F

G

Gallai–Edmonds decomposition

H

I

Induced matching

K

Kőnig's theorem (graph theory)

M

P

Q

Quantum dimer models

R

S

T

W

Weapon target assignment problem

Retrieved from "https://en.wikipedia.org/w/index.php?title=Category:Matching_(graph_theory)&oldid=964588871"

Uses material from the Wikipedia article Category:Matching (graph theory), released under the CC BY-SA 4.0 license.