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)- Minimum-cost flow problem (← links)
- Induced matching (← links)
- Assignment problem (← links)
- Dominating set (← links)
- FKT algorithm (← links)
- Matroid intersection (← links)
- Maximum weight matching (← links)
- Maximal independent set (← links)
- Clique cover (← links)
- Search problem (← links)
- Vertex cover (← links)
- Travelling salesman problem (← links)
- Independent set (graph theory) (← links)
- Clique problem (← links)
- Route inspection problem (← links)
- Edge cover (← links)
- Network controllability (← links)
- Maximally-matchable edge (← links)
- Hypohamiltonian graph (← links)
- Simultaneous embedding (← links)
- Threshold graph (← links)
- Line graph (← links)
- Bipartite network projection (← links)
- Complete graph (← links)
- Odd graph (← links)
- Bin packing problem (← links)
- Permutation graph (← links)
- Matroid oracle (← links)
- Matroid girth (← links)
- Perfect matching in high-degree hypergraphs (← links)
- Integral polytope (← links)
- Perfect matching (← links)
- 228 (number) (← links)
- Folkman graph (← links)
- Gadget (computer science) (← links)
- Fractional matching (← links)
- Perfect graph (← links)
- ♯P-complete (← links)
- Induced subgraph (← links)
- Matching in hypergraphs (← links)
- Vertex cover in hypergraphs (← links)
- Vickrey–Clarke–Groves auction (← links)
- Minimum-weight triangulation (← links)
- Matching polytope (← links)
- Path cover (← links)
- Rainbow matching (← links)
- Tietze's graph (← links)
- Hall-type theorems for hypergraphs (← links)
- Edge coloring (← links)
- Combinatorics: The Rota Way (← links)
