Search results
We did not find results for: tripartite graph.
Check spelling or type a new query.
We did not find results for: tripartite graph.
Check spelling or type a new query.
Graph whose vertices are or can be partitioned into multiple different independent sets
In graph theory, a part of mathematics, a k-partite graph is a graph whose vertices are partitioned into k different independent sets. Equivalently, it is a graph that can be colored with k colors, so that no two endpoints of an edge have the same color. When k = 2 these are the bipartite graphs, and when k = 3 they are called the tripartite graphs. Wikipedia