Pages that link to "Matching (graph theory)"
From HandWiki
The following pages link to Matching (graph theory):
Displayed 50 items.
View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)- Graph theory (← links)
- Linear programming (← links)
- 3-dimensional matching (← links)
- Big O notation (← links)
- Combinatorial optimization (← links)
- Covering problems (← links)
- Degree (graph theory) (← links)
- Domino tiling (← links)
- Glossary of graph theory terms (← links)
- Hall's marriage theorem (← links)
- Kernelization (← links)
- Kőnig's theorem (graph theory) (← links)
- Matroid (← links)
- Maximum cardinality matching (← links)
- Network science (← links)
- Network theory (← links)
- Rook polynomial (← links)
- Set cover problem (← links)
- Set packing (← links)
- Stable marriage problem (← links)
- Stable roommates problem (← links)
- Telephone number (mathematics) (← links)
- Approximation algorithm (← links)
- Birkhoff polytope (← links)
- Unimodular matrix (← links)
- Algebraic geometry (← links)
- Graph coloring (← links)
- Graph polynomial (← links)
- Hosoya index (← links)
- List of graph theory topics (← links)
- List of NP-complete problems (← links)
- Matching polynomial (← links)
- Ménage problem (← links)
- Tutte polynomial (← links)
- Minimum spanning tree (← links)
- Rado graph (← links)
- Secretary problem (← links)
- Skew-symmetric graph (← links)
- Trémaux tree (← links)
- Bipartite graph (← links)
- Topological graph theory (← links)
- Ruzsa–Szemerédi problem (← links)
- Berge's lemma (← links)
- Domatic number (← links)
- Hall violator (← links)
- Hungarian algorithm (← links)
- Extension of a polyhedron (← links)
- Branch-decomposition (← links)
- Saturation (graph theory) (← links)
- Minimum-cost flow problem (← links)
