Pages that link to "Perfect matching"
Showing 50 items.
- Factorial (links | edit)
- List of algorithms (links | edit)
- ♯P-complete (links | edit)
- Steiner system (links | edit)
- Tesseract (links | edit)
- Travelling salesman problem (links | edit)
- Complete graph (links | edit)
- Hall's marriage theorem (links | edit)
- Petersen graph (links | edit)
- 15 (number) (links | edit)
- Permanent (mathematics) (links | edit)
- Bipartite graph (links | edit)
- Component (graph theory) (links | edit)
- Erdős–Ko–Rado theorem (links | edit)
- Glossary of graph theory (links | edit)
- Inclusion–exclusion principle (links | edit)
- Outerplanar graph (links | edit)
- Turán graph (links | edit)
- Graph coloring (links | edit)
- Double factorial (links | edit)
- Complete bipartite graph (links | edit)
- Pfaffian (links | edit)
- Matching (graph theory) (links | edit)
- Line graph (links | edit)
- Strongly connected component (links | edit)
- Edge coloring (links | edit)
- List of terms relating to algorithms and data structures (links | edit)
- Transversal (combinatorics) (links | edit)
- Cubic graph (links | edit)
- Net (polyhedron) (links | edit)
- Pell number (links | edit)
- Heawood graph (links | edit)
- Tutte–Coxeter graph (links | edit)
- Circuit rank (links | edit)
- Tutte theorem (links | edit)
- List of NP-complete problems (links | edit)
- Parity P (links | edit)
- Hungarian algorithm (links | edit)
- Dulmage–Mendelsohn decomposition (links | edit)
- Schwartz–Zippel lemma (links | edit)
- Exact cover (links | edit)
- Tensor product of graphs (links | edit)
- Graph factorization (links | edit)
- Christofides algorithm (links | edit)
- Brauer algebra (links | edit)
- Edge cover (links | edit)
- Quartic graph (links | edit)
- Yao's principle (links | edit)
- Grundy number (links | edit)
- Kőnig's theorem (graph theory) (links | edit)