# Category:Matching (graph theory)

Computing portal |

Here is a list of articles in the Matching (graph theory) category of the Computing portal that unifies foundations of mathematics and computations using computers.

## Pages in category "Matching (graph theory)"

The following 43 pages are in this category, out of 43 total.

- Matching (graph theory)
*(computing)*

### 1

- 1-factor
*(computing)*

### 3

- 3-dimensional matching
*(computing)*

### A

- Assignment problem
*(computing)*

### B

- Berge's lemma
*(computing)*

### C

- Claw-free graph
*(computing)*

### D

- Domino tiling
*(computing)* - Dulmage–Mendelsohn decomposition
*(computing)*

### E

- Blossom algorithm
*(computing)*

### F

- Factor-critical graph
*(computing)* - Fractional matching
*(computing)*

### G

- Gallai–Edmonds decomposition
*(computing)*

### H

- Hafnian
*(computing)* - Hall's marriage theorem
*(computing)* - Hall-type theorems for hypergraphs
*(computing)* - Hopcroft–Karp algorithm
*(computing)* - Hosoya index
*(computing)* - Hungarian algorithm
*(computing)*

### I

- Induced matching
*(computing)*

### K

- Kőnig's theorem (graph theory)
*(computing)*

### M

- Matching in hypergraphs
*(computing)* - Matching polynomial
*(computing)* - Matching polytope
*(computing)* - Matching preclusion
*(computing)* - Maximally-matchable edge
*(computing)* - Maximum cardinality matching
*(computing)*

### P

- Partition matroid
*(computing)* - Perfect matching
*(computing)* - Perfect matching in high-degree hypergraphs
*(computing)* - Petersen's theorem
*(computing)* - Pfaffian orientation
*(computing)*

### Q

- Quantum dimer models
*(physics)*

### R

- Ruzsa–Szemerédi problem
*(computing)*

### S

- Saturation (graph theory)
*(computing)* - Secretary problem
*(computing)* - Skew-symmetric graph
*(computing)*

### T

- Telephone number (mathematics)
*(computing)* - Top trading cycle
*(computing)* - Transportation theory (mathematics)
*(computing)* - Tutte matrix
*(computing)* - Tutte theorem
*(computing)* - Tutte–Berge formula
*(computing)*

### W

- Weapon target assignment problem
*(computing)*