Complete bipartite graph

Complete bipartite graph — полный двудольный граф.

A bipartite graph $\,G = (X,Y,E)$, denoted $\,K_{m,n}$, in which every vertex of $\,X$ is adjacent to every vertex of $\,Y$. Here $\,m = |X|$ and $\,n = |Y|$. The treewidth of complete bipartite graph is $\,\min(m,n)$.

Литература

• Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.