Couplage Maximum dans un graphe biparti (Maximum matching in a bipartite graph)
![](https://i.ytimg.com/vi/djKLm1bJ7-o/mqdefault.jpg)
11:16
Couplages dans les graphes
![](https://i.ytimg.com/vi/K-g5AzHACWs/mqdefault.jpg)
14:39
Kőnig's theorem (proof and example) #SoME3
![](https://i.ytimg.com/vi/xvmlEzcwpU4/mqdefault.jpg)
7:51
Solving a 'Stanford' University entrance exam | x=?
![](https://i.ytimg.com/vi/6oUE0_QLDhU/mqdefault.jpg)
11:44
Argumenter sur les couplages maximums (how to argue about maximum matching)
![](https://i.ytimg.com/vi/EwV4Puk2coU/mqdefault.jpg)
12:21
What are Isomorphic Graphs? | Graph Isomorphism, Graph Theory
![](https://i.ytimg.com/vi/TgT5MYWI2n4/mqdefault.jpg)
13:54
Flots 1 : introduction et notions de base des flots (graphes)
![](https://i.ytimg.com/vi/pmMwGyoGlXk/mqdefault.jpg)
33:00
Bipartite Graphs and Maximum Matchings
![](https://i.ytimg.com/vi/LdOnanfc5TM/mqdefault.jpg)
13:25