Pages that link to "Matching (graph theory)"
Jump to navigation
Jump to search
The following pages link to Matching (graph theory):
Displaying 40 items.
- Conductance (graph theory) (← links)
- Kernelization (← links)
- Branch-decomposition (← links)
- Network science (← links)
- Skew-symmetric graph (← links)
- Permutation graph (← links)
- Search and matching theory (economics) (← links)
- Vickrey–Clarke–Groves auction (← links)
- Ménage problem (← links)
- Odd graph (← links)
- Minimum-weight triangulation (← links)
- Matroid intersection (← links)
- Folkman graph (← links)
- Matching polynomial (← links)
- Integral polytope (← links)
- FKT algorithm (← links)
- Trémaux tree (← links)
- Network controllability (← links)
- Telephone number (mathematics) (← links)
- Matroid oracle (← links)
- Matroid girth (← links)
- Unit demand (← links)
- Ruzsa–Szemerédi problem (← links)
- Induced matching (← links)
- Maximally matchable edge (← links)
- Matching in hypergraphs (← links)
- Hall-type theorems for hypergraphs (← links)
- Fractional matching (← links)
- Perfect matching in high-degree hypergraphs (← links)
- Matching polytope (← links)
- Independence complex (← links)
- Rainbow-independent set (← links)
- Priority matching (← links)
- Proportional item allocation (← links)
- Multidimensional assignment problem (← links)
- Parameterized approximation algorithm (← links)
- Carving width (← links)
- Draft:Aharoni-Korman conjecture (← links)
- Testwiki:Reference desk/Archives/Mathematics/2012 July 23 (← links)
- Testwiki:School and university projects/Discrete and numerical mathematics/Learning plan (← links)