---
tag: 520X5V4T56
kind: concept
name: Multipartite graph
aliases: [complete-multipartite-graph, k-partite-graph, tripartite-graph, tripartite-graphs-and-networks]
sources:
  - wikipedia: en:39469099@r1370112005
    locator: Multipartite graph
    note: adopted
    mention: wikipedia://en/39469099
    sections: [Summary]
same_as:
  wikidata: Q1718082
  wikipedia: Multipartite graph
inventory: [VF6RBQ8ZHQ]
---

## Summary

In graph theory, a part of mathematics, a **$k$-partite graph** is a [[graph|00C0BR7D7H]] whose vertices are (or can be) partitioned into $k$ different [[independent sets|08ANQHHG3P]]. Equivalently, it is a graph that can be [[colored|0NCPXH194Y]] with $k$ colors, so that no two endpoints of an edge have the same color. When $k = 2$ these are the [[bipartite graphs|07DVHJ8N0A]], and when $k = 3$ they are called the **tripartite graphs**.