Category:Complete bipartite graphs

From Wikimedia Commons, the free media repository
Jump to: navigation, search
 The article Complete bipartite graphs on Wikipedia projects: (en) Complete bipartite graph ·
(ca) Graf bipartit complet · (eo) Plena dukolora grafeo · (es) Grafo bipartito completo · (fa) گراف کامل دوبخشی · (fr) Graphe biparti complet · (hu) Teljes páros gráf · (it) Grafo bipartito completo · (ja) 完全2部グラフ · (ko) 완전 이분 그래프 · (pt) Grafo bipartido completo · (sv) Komplett bipartit graf · (th) กราฟสองส่วนบริบูรณ์ · (vi) Đồ thị hai phía đầy đủ · (zh) 完全二分图 · +/−

A complete bipartite graph or biclique in the mathematical field of graph theory is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set.


This category has the following 3 subcategories, out of 3 total.