Multipartite graph
Summary
In graph theory, a part of mathematics, a -partite graph is a graph whose vertices are (or can be) partitioned into different independent sets. Equivalently, it is a graph that can be colored with colors, so that no two endpoints of an edge have the same color. When these are the bipartite graphs, and when they are called the tripartite graphs.
Further reading
- Wikipedia, page 39469099, revision 1370112005, Multipartite graph. adopted
About this page
| Tag | 520X5V4T56 |
|---|---|
| URI | m2://520X5V4T56 |
| Aliases | complete-multipartite-graph, k-partite-graph, tripartite-graph, tripartite-graphs-and-networks |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.