Bipartite
41Graphe bipartite — Graphe biparti Exemple de graphe biparti quelconque En théorie des graphes, un graphe est dit biparti s il existe une partition de son ensemble de sommets en deux sous ensembles U et V telle que chaque arête ait une extrémité dans U et l autre da …
42patella bipartita — bipartite patella a patella that is divided into two parts …
43placenta bipartita — bipartite placenta bilobate p …
44König's theorem (graph theory) — In the mathematical area of graph theory, König s theorem describes an equivalence between the maximum matching problem and the minimum vertex cover problem in bipartite graphs. Setting A graph is bipartite if its vertices can be partitioned into …
45Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… …
46biparti — biparti, ie [ biparti ] ou bipartite [ bipartit ] adj. • 1361, 1768; bas lat. bipartitus, p. p. de bipartire, de bi (bis) et partire « partager » ♦ Qui est divisé en deux parties. « ces portillons bipartis, dont le haut ne se ferme que le soir »… …
47Multipartite entanglement — In the case of systems composed of subsystems the definition of separable and entangled states is richer than in the bipartite case. Indeed, in the multipartite case, apart from fully separable and fully entangled states, there also exists the… …
48Matching (graph theory) — In the mathematical discipline of graph theory, a matching or independent edge set in a graph is a set of edges without common vertices. It may also be an entire graph consisting of edges without common vertices. Covering packing dualities… …
49Matching (Graphentheorie) — Die Theorie um das Finden von Matchings in Graphen ist in der diskreten Mathematik ein umfangreiches Teilgebiet, das in die Graphentheorie eingeordnet wird. Folgende Situation wird dabei betrachtet: Gegeben eine Menge von Dingen und zu diesen… …
50Maximum cut — A maximum cut. For a graph, a maximum cut is a cut whose size is at least the size of any other cut. The problem of finding a maximum cut in a graph is known as the max cut problem. The problem can be stated simply as follows. One wants a subset… …
